LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm
Ziyu Liu, Guolin Ke, Jiang Bian, Tieyan Liu

TL;DR
LightMC is a novel multiclass decomposition algorithm that dynamically optimizes coding and decoding strategies using differentiable methods, leading to improved accuracy and efficiency in large-scale classification tasks.
Contribution
It introduces a differentiable decoding strategy allowing dynamic optimization of coding matrices and decoding strategies during training.
Findings
Outperforms existing ECOC-based methods in accuracy.
Demonstrates high efficiency on large-scale datasets.
Achieves better accuracy through joint optimization.
Abstract
Multiclass decomposition splits a multiclass classification problem into a series of independent binary learners and recomposes them by combining their outputs to reconstruct the multiclass classification results. Three widely-used realizations of such decomposition methods are One-Versus-All (OVA), One-Versus-One (OVO), and Error-Correcting-Output-Code (ECOC). While OVA and OVO are quite simple, both of them assume all classes are orthogonal which neglect the latent correlation between classes in real-world. Error-Correcting-Output-Code (ECOC) based decomposition methods, on the other hand, are more preferable due to its integration of the correlation among classes. However, the performance of existing ECOC-based methods highly depends on the design of coding matrix and decoding strategy. Unfortunately, it is quite uncertain and time-consuming to discover an effective coding matrix…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Machine Learning and Algorithms · Machine Learning and ELM
