Support vector machines are universally consistent
From MaRDI portal
Publication:1872633
DOI10.1006/jcom.2002.0642zbMath1030.68074OpenAlexW1998438337WikidataQ59196445 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
Related Items
A new learning paradigm: learning using privileged information, Non-asymptotic error bound for optimal prediction of function-on-function regression by RKHS approach, Statistical behavior and consistency of classification methods based on convex risk minimization., Spatio-temporal convolution kernels, Fully online classification by regularization, A consistency result for functional SVM by spline interpolation, Multi-kernel regularized classifiers, Universally consistent vertex classification for latent positions graphs, Averaging versus voting: a comparative study of strategies for distributed classification, Generalization and learning rate of multi-class support vector classification and regression, Statistical performance of support vector machines, Consistency and convergence rate for nearest subspace classifier, A Note on Support Vector Machines with Polynomial Kernels, Comment, Kernel methods in machine learning, Estimation of the misclassification error for multicategory support vector machine classification, Learning from dependent observations, On qualitative robustness of support vector machines, Learning errors of linear programming support vector regression, The consistency of multicategory support vector machines, SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming, Approximation with polynomial kernels and SVM classifiers, Fast rates for support vector machines using Gaussian kernels, Analysis of regularized least squares for functional linear regression model, Comment, Robustness of learning algorithms using hinge loss with outlier indicators, Theory of Classification: a Survey of Some Recent Advances, Learning rates of gradient descent algorithm for classification, Robust support vector machines for multiple instance learning, Relaxing support vectors for classification, A tutorial on ν‐support vector machines, Two‐sample test based on classification probability, Robust learning from bites for data mining, Unnamed Item, Sparse classification: a scalable discrete optimization perspective, Online regularized generalized gradient classification algorithms, Distribution-free consistency of empirical risk minimization and support vector regression, Online Classification with Varying Gaussians, Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context
Cites Work
