One of the nice properties of kernel classifiers such as SVMs is that they often produce sparse solutions. However, the decision functions of these classifiers cannot always be used to estimate the conditional probability of the class label. We investigate the relationship between these two properties and show that these are intimately related: sparseness does not occur when the conditional probabilities can be unambiguously estimated. We consider a family of convex loss functions and derive sharp asymptotic bounds for the number of support vectors. This enables us to characterize the exact trade-off between sparseness and the ability to estimate conditional probabilities for these loss functions.
CITATION STYLE
Bartlett, P. L., & Tewari, A. (2004). Sparseness versus estimating conditional probabilities: Some asymptotic results. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3120, pp. 564–578). Springer Verlag. https://doi.org/10.1007/978-3-540-27819-1_39
Mendeley helps you to discover research relevant for your work.