Multiclass classification machines with the complexity of a single binary classifier

In this paper, we study the multiclass classification problem. We derive a framework to solve this problem by providing algorithms with the complexity of a single binary classifier. The resulting multiclass machines can be decomposed into two categories. The first category corresponds to vector-output machines, where we develop several algorithms. In the second category, we show that the least-squares classifier can be easily cast into a multiclass one-versus-all scheme, without the need to train multiple binary classifiers. The proposed framework shows that, while keeping the classification accuracy essentially unchanged, the computational complexity is orders of magnitude lower than those previously reported in the literature. This makes our approach extremely powerful and conceptually simple. Moreover, we study the coding of the multiclass labels, and demonstrate that several celebrated approaches are equivalent. These arguments are illustrated with experimentations on well-known benchmarks. ⺠One-versus-all scheme in multiclass classification. ⺠We operate a one-versus-all multiclass classifier, without training multiple binary classifiers. ⺠With the same classification accuracy, the computational complexity is orders of magnitude lower. ⺠We show that several celebrated coding of the multiclass labels have identical performance.