Classification with polynomial kernels and l^1-coefficient regularization

DOI10.11650/TJM.18.2014.3929zbMATH Open1359.62265OpenAlexW1984344762MaRDI QIDQ514786FDOQ514786

Authors: Hongzhi Tong, Di-Rong Chen, Fenghong Yang 

Publication date: 9 March 2017

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm.18.2014.3929

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

zbMATH Keywords

classificationcoefficient regularizationpolynomial kernelsBernstein-Kantorovich polynomiallearning rates

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• On the mathematical foundations of learning
• Title not available (Why is that?)
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Support vector machine soft margin classifiers: error analysis
• Local polynomial reproduction and moving least squares approximation
• The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network
• Learning with sample dependent hypothesis spaces
• Multi-kernel regularized classifiers
• Approximation with polynomial kernels and SVM classifiers
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
• Support vector machines regression with \(l^1\)-regularizer

Cited In (3)

• Learning rates for regularized classifiers using multivariate polynomial kernels
• Training and testing low-degree polynomial data mappings via linear SVM
• Approximation with polynomial kernels and SVM 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)