Classification with polynomial kernels and l^1-coefficient regularization
From MaRDI portal
Publication:514786
Recommendations
- Learning rates for regularized classifiers using multivariate polynomial kernels
- Learning rates for \(l^1\)-regularized kernel classifiers
- Approximation with polynomial kernels and SVM classifiers
- Learning rates of least-square regularized regression with polynomial kernels
- Learning by atomic norm regularization with polynomial kernels
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- Approximation with polynomial kernels and SVM classifiers
- Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
- Learning with sample dependent hypothesis spaces
- Local polynomial reproduction and moving least squares approximation
- Multi-kernel regularized classifiers
- On the mathematical foundations of learning
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Support vector machine soft margin classifiers: error analysis
- Support vector machines regression with \(l^1\)-regularizer
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
Cited in
(5)- Training and testing low-degree polynomial data mappings via linear SVM
- Learning rates for regularized classifiers using multivariate polynomial kernels
- Approximation with polynomial kernels and SVM classifiers
- Learning by atomic norm regularization with polynomial kernels
- Learning rates for \(l^1\)-regularized kernel classifiers
This page was built for publication: Classification with polynomial kernels and \(l^1\)-coefficient regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514786)