Support vector machines are universally consistent
From MaRDI portal
Publication:1872633
DOI10.1006/jcom.2002.0642zbMath1030.68074WikidataQ59196445 ScholiaQ59196445MaRDI QIDQ1872633
Publication date: 14 May 2003
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6dc89a5bf39cc05113e1ad2b8ddbbcd1e737be62
68T05: Learning and adaptive systems in artificial intelligence
Related Items
SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming, A tutorial on ν‐support vector machines, Online Classification with Varying Gaussians, On qualitative robustness of support vector machines, A consistency result for functional SVM by spline interpolation, Multi-kernel regularized classifiers, Kernel methods in machine learning, Estimation of the misclassification error for multicategory support vector machine classification, Learning from dependent observations, Fast rates for support vector machines using Gaussian kernels, Robust learning from bites for data mining, Distribution-free consistency of empirical risk minimization and support vector regression, Statistical behavior and consistency of classification methods based on convex risk minimization., Fully online classification by regularization, Statistical performance of support vector machines, The consistency of multicategory support vector machines, Approximation with polynomial kernels and SVM classifiers, Learning rates of gradient descent algorithm for classification, Theory of Classification: a Survey of Some Recent Advances
Cites Work
