Universal Consistency of Multi-Class Support Vector Classification
Steinwart was the first to prove universal consistency of support vector machine classification. His proof analyzed the ‘standard’ support vector machine classifier, which is restricted to binary classification problems. In contrast, recent analysis has resulted in the common belief that several extensions of SVM classification to more than two classes are inconsistent. Countering this belief, we proof the universal consistency of the multi-class support vector machine by Crammer and Singer. Our proof extends Steinwart’s techniques to the multi-class case.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
$k$-Nearest Neighbors in Gromov--Wasserstein Space
The Gromov--Wasserstein (GW) distance provides a framework for comparing metric measure spaces, regardless of their underlying structure or geometry. For network-based data, it enables direct comparisons of graphs with d…
Universal Consistency and Robustness of Localized Support Vector Machines
The massive amount of available data potentially used to discover patters in machine learning is a challenge for kernel based algorithms with respect to runtime and storage capacities. Local approaches might help to reli…
BIG-bench Machine LearningOptimization Models and Interpretations for Three Types of Adversarial Perturbations against Support Vector Machines
Adversarial perturbations have drawn great attentions in various deep neural networks. Most of them are computed by iterations and cannot be interpreted very well. In contrast, little attentions are paid to basic machine…
Universal consistency of Wasserstein $k$-NN classifier: Negative and Positive Results
The Wasserstein distance provides a notion of dissimilarities between probability measures, which has recent applications in learning of structured data with varying size such as images and text documents. In this work, …
Generalizing Importance Weighting to A Universal Solver for Distribution Shift Problems
Distribution shift (DS) may have two levels: the distribution itself changes, and the support (i.e., the set where the probability density is non-zero) also changes. When considering the support change between the traini…