Support vector machines regression with l^1-regularizer

DOI10.1016/J.JAT.2012.06.005MaRDI QIDQ1759352zbMATHOpenAlexFDO

Authors Hongzhi Tong, Di-Rong Chen, Fenghong Yang

Publication date 20 November 2012

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jat.2012.06.005

zbMATH Keywords

reproducing kernel Hilbert spacescoefficient regularizationlearning rateerror decompositionsupport vector machines regression

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)

Recommendations

• Analysis of support vector machines regression
• A simpler approach to coefficient regularized support vector machines regression
• Least squares regression with \(l_1\)-regularizer in sum space
• Learning with varying insensitive loss
• An approximation theory approach to learning with \(\ell^1\) regularization

Cites work

• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Analysis of support vector machines regression
• Classifiers of support vector machine type with \(\ell_1\) complexity regularization
• Decoding by Linear Programming
• ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
• Learning Theory
• Learning by nonsymmetric kernels with data dependent spaces and \(\ell^1\)-regularizer
• Learning rates of least-square regularized regression
• Learning with sample dependent hypothesis spaces
• Least square regression with indefinite kernels and coefficient regularization
• Model selection for regularized least-squares algorithm in learning theory
• On the mathematical foundations of learning
• Regularization networks and support vector machines
• SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
• Support vector machine soft margin classifiers: error analysis
• Theory of Reproducing Kernels

Cited in

(13)

• scientific article; zbMATH DE number 5957245 (Why is no real title available?)
• \(\ell^{1}\)-norm support vector machine for ranking with exponentially strongly mixing sequence
• Optimal rate for support vector machine regression with Markov chain samples
• A simpler approach to coefficient regularized support vector machines regression
• Learning with varying insensitive loss
• The equivalence of support vector machine and regularization neural networks
• Analysis of support vector machines regression
• Regularization networks and support vector machines
• Classification with polynomial kernels and \(l^1\)-coefficient regularization
• Kernel methods for independence measurement with coefficient constraints
• A \(q\)-norm regularizing least-square-support-vector-machine linear classifier algorithm via iterative reweighted conjugate gradient
• Quadratic surface support vector machine with L1 norm regularization
• Regularized ranking with convex losses and \(\ell^1\)-penalty

This page was built for publication: Support vector machines regression with \(l^1\)-regularizer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759352)