Learning rates for l^1-regularized kernel classifiers
DOI10.1155/2013/496282zbMATH Open1397.62232DBLPjournals/jam/TongCY13OpenAlexW2067238686WikidataQ59006280 ScholiaQ59006280MaRDI QIDQ1789959FDOQ1789959
Authors: Hongzhi Tong, Di-Rong Chen, Fenghong Yang 
Publication date: 10 October 2018
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/496282
Recommendations
- Classification with polynomial kernels and \(l^1\)-coefficient regularization
- Learning rates for regularized classifiers using multivariate polynomial kernels
- Multi-kernel regularized classifiers
- An approximation theory approach to learning with \(\ell^1\) regularization
- Approximation with polynomial kernels and SVM classifiers
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cited In (17)
- Learning rates for regularized classifiers using multivariate polynomial kernels
- Optimal learning rates for kernel partial least squares
- Title not available (Why is that?)
- An approximation theory approach to learning with \(\ell^1\) regularization
- Ideal regularization for learning kernels from labels
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Multi-kernel regularized classifiers
- Learning sparse low-threshold linear classifiers
- Learning rates of kernel-based robust classification
- Approximate minimization of the regularized expected error over kernel models
- Learning Rates of lq Coefficient Regularization Learning with Gaussian Kernel
- Learning rates for multi-kernel linear programming classifiers
- Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
- Regularized ranking with convex losses and \(\ell^1\)-penalty
- Error analysis of classification learning algorithms based on LUMs loss
- The learning rate of \(l_2\)-coefficient regularized classification with strong loss
- Classification with polynomial kernels and \(l^1\)-coefficient regularization
This page was built for publication: Learning rates for \(l^1\)-regularized kernel classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789959)
