Generalization performance of Lagrangian support vector machine based on Markov sampling
From MaRDI portal
(Redirected from Publication:830752)
Recommendations
- Generalization performance of Gaussian kernels SVMC based on Markov sampling
- Optimal rate for support vector machine regression with Markov chain samples
- Generalization performance of least-square regularized regression algorithm with Markov chain samples
- 10.1162/15324430152748218
- Generalization and learning rate of multi-class support vector classification and regression
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- 10.1162/15324430152748218
- 10.1162/153244302760200713
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Learning and generalisation. With applications to neural networks.
- Learning rates of least-square regularized regression
- Learning rates of regularized regression for exponentially strongly mixing sequence
- On the mathematical foundations of learning
- Online Regularized Classification Algorithms
- Rates of convergence for empirical processes of stationary mixing sequences
- Regularization networks and support vector machines
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support Vector Machines
- Support vector machine soft margin classifiers: error analysis
- The generalization performance of ERM algorithm with strongly mixing observations
- Theory of Reproducing Kernels
- Uniform ergodicity and strong mixing
Cited in
(2)
This page was built for publication: Generalization performance of Lagrangian support vector machine based on Markov sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830752)