On sparsity inducing regularization methods for machine learning
From MaRDI portal
Abstract: During the past years there has been an explosion of interest in learning methods based on sparsity regularization. In this paper, we discuss a general class of such methods, in which the regularizer can be expressed as the composition of a convex function with a linear function. This setting includes several methods such the group Lasso, the Fused Lasso, multi-task learning and many more. We present a general approach for solving regularization problems of this kind, under the assumption that the proximity operator of the function is available. Furthermore, we comment on the application of this approach to support vector machines, a technique pioneered by the groundbreaking work of Vladimir Vapnik.
Recommendations
- Regularization, optimization, kernels, and support vector machines
- Regularizers for structured sparsity
- A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer
- Optimization problems in statistical learning: duality and optimality conditions
- Structured sparsity through convex optimization
Cited in
(6)- scientific article; zbMATH DE number 7307489 (Why is no real title available?)
- Regularization, optimization, kernels, and support vector machines
- Sparse approximations with interior point methods
- Sparsity-enforcing regularisation and ISTA revisited
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- ADMM Algorithmic Regularization Paths for Sparse Statistical Machine Learning
This page was built for publication: On sparsity inducing regularization methods for machine learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264102)