Support vector machines are universally consistent
From MaRDI portal
Recommendations
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- On the influence of the kernel on the consistency of support vector machines
- Support Vector Machines
- Support vector machines
- The consistency of multicategory support vector machines
- Consistency of support vector machines using additive kernels for additive models
- Demonstrating the stability of support vector machines for classification
- Robustness and regularization of support vector machines
- Learning with rigorous support vector machines.
Cites work
- scientific article; zbMATH DE number 3883309 (Why is no real title available?)
- scientific article; zbMATH DE number 44592 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- On the influence of the kernel on the consistency of support vector machines
- Support-vector networks
Cited in
(45)- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Estimation of the misclassification error for multicategory support vector machine classification
- Online regularized generalized gradient classification algorithms
- Robust learning from bites for data mining
- Universally consistent vertex classification for latent positions graphs
- Universal consistency of localized versions of regularized kernel methods
- Online classification with varying Gaussians
- A new learning paradigm: learning using privileged information
- Learning errors of linear programming support vector regression
- Analysis of support vector machine classification
- On the consistency of the bootstrap approach for support vector machines and related kernel-based methods
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Comment
- A consistency result for functional SVM by spline interpolation
- Sparse classification: a scalable discrete optimization perspective
- Consistency and convergence rates of one-class SVMs and related algorithms
- Non-asymptotic error bound for optimal prediction of function-on-function regression by RKHS approach
- Spatio-temporal convolution kernels
- Approximation with polynomial kernels and SVM classifiers
- Kernel and Dissimilarity Methods for Exploratory Analysis in a Social Context
- The consistency of multicategory support vector machines
- Multi-kernel regularized classifiers
- On the influence of the kernel on the consistency of support vector machines
- Fast rates for support vector machines using Gaussian kernels
- A tutorial on ν‐support vector machines
- Consistency and convergence rate for nearest subspace classifier
- Learning rates of gradient descent algorithm for classification
- On qualitative robustness of support vector machines
- Averaging versus voting: a comparative study of strategies for distributed classification
- A note on support vector machines with polynomial kernels
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- Distribution-free consistency of empirical risk minimization and support vector regression
- Robustness of learning algorithms using hinge loss with outlier indicators
- Two‐sample test based on classification probability
- Comment
- Statistical performance of support vector machines
- On consistent vertex nomination schemes
- Fully online classification by regularization
- Generalization and learning rate of multi-class support vector classification and regression
- Kernel methods in machine learning
- Analysis of regularized least squares for functional linear regression model
- Learning from dependent observations
- Relaxing support vectors for classification
- Robust support vector machines for multiple instance learning
- Theory of Classification: a Survey of Some Recent Advances
This page was built for publication: Support vector machines are universally consistent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872633)