Margin-Independent Online Multiclass Learning via Convex GeometryDownload PDF

21 May 2021, 20:51 (modified: 26 Oct 2021, 21:57)NeurIPS 2021 PosterReaders: Everyone
Keywords: Multiclass Classification, Online Learning
TL;DR: We design algorithms for multi-class classification that minimize the average size of mistakes instead of simply the number of mistakes.
Abstract: We consider the problem of multi-class classification, where a stream of adversarially chosen queries arrive and must be assigned a label online. Unlike traditional bounds which seek to minimize the misclassification rate, we minimize the total distance from each query to the region corresponding to its assigned label. When the true labels are determined via a nearest neighbor partition -- i.e. the label of a point is given by which of $k$ centers it is closest to in Euclidean distance -- we show that one can achieve a loss that is independent of the total number of queries. We complement this result by showing that learning general convex sets requires an almost linear loss per query. Our results build off of regret guarantees for the problem of contextual search. In addition, we develop a novel reduction technique from multiclass classification to binary classification which may be of independent interest.
Supplementary Material: pdf
Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
9 Replies