Sparsity by Worst-Case Quadratic Penalties
Preprint
Abstract
This paper proposes a new robust regression interpretation of sparse penalties such as the elastic net and the group-lasso. Beyond providing a new viewpoint on these penalization schemes, our approach results in a unified optimization strategy. Our evaluation experiments demonstrate that this strategy, implemented on the elastic net, is computationally extremely efficient for small to medium size problems. Our accompanying software solves problems at machine precision in the time required to get a rough estimate with competing state-of-the-art algorithms.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Optimization with Sparsity-Inducing PenaltiesFoundations and Trends in Machine Learning, 2012
- Regularization Paths for Cox's Proportional Hazards Model via Coordinate DescentJournal of Statistical Software, 2011
- Robust Regression and LassoIEEE Transactions on Information Theory, 2010
- Feature selection guided by structural informationThe Annals of Applied Statistics, 2010
- Regularization Paths for Generalized Linear Models via Coordinate Descent2010
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Simultaneous Regression Shrinkage, Variable Selection, and Supervised Clustering of Predictors with OSCARBiometrics, 2008
- Regularization and Variable Selection Via the Elastic NetJournal of the Royal Statistical Society Series B: Statistical Methodology, 2005
- Parameter Estimation in the Presence of Bounded Data UncertaintiesSIAM Journal on Matrix Analysis and Applications, 1998
- Robust Solutions to Least-Squares Problems with Uncertain DataSIAM Journal on Matrix Analysis and Applications, 1997