A Quadratic Loss Multi-Class SVM
Emmanuel Monfrini (LORIA), Yann Guermeur (LORIA)

TL;DR
This paper introduces a quadratic loss multi-class SVM, extending the 2-norm SVM to handle multiple classes, and establishes a generalized radius-margin bound for it, aiding model selection.
Contribution
It proposes the M-SVM^2, a novel multi-class SVM with quadratic loss, and derives a generalized radius-margin bound for improved error estimation.
Findings
Introduces the M-SVM^2 model for multi-class classification.
Establishes a generalized radius-margin bound for the new model.
Provides theoretical foundation for model selection in multi-class SVMs.
Abstract
Using a support vector machine requires to set two types of hyperparameters: the soft margin parameter C and the parameters of the kernel. To perform this model selection task, the method of choice is cross-validation. Its leave-one-out variant is known to produce an estimator of the generalization error which is almost unbiased. Its major drawback rests in its time requirement. To overcome this difficulty, several upper bounds on the leave-one-out error of the pattern recognition SVM have been derived. Among those bounds, the most popular one is probably the radius-margin bound. It applies to the hard margin pattern recognition SVM, and by extension to the 2-norm SVM. In this report, we introduce a quadratic loss M-SVM, the M-SVM^2, as a direct extension of the 2-norm SVM to the multi-class case. For this machine, a generalized radius-margin bound is then established.
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
TopicsNeural Networks and Applications
