Generalization bounds of incremental SVM
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- 10.1162/15324430152748218
- 10.1162/153244302760200704
- 10.1162/153244302760200713
- Analysis of support vector machines regression
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Convexity, Classification, and Risk Bounds
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains
- Large margin methods for structured and interdependent output variables
- 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
- Learning theory: from regression to classification
- Minimum complexity regression estimation with weakly dependent observations
- ONLINE LEARNING WITH MARKOV SAMPLING
- On the mathematical foundations of learning
- Online Regularized Classification Algorithms
- 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
- The learning performance of support vector machine classification based on Markov sampling
- The performance bounds of learning machines based on exponentially strongly mixing sequences
- Theory of Reproducing Kernels
- Uniform ergodicity and strong mixing
This page was built for publication: Generalization bounds of incremental SVM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034060)
