Rank-one Convexification for Sparse Regression
Alper Atamturk, Andres Gomez

TL;DR
This paper introduces new convex relaxations for sparse regression that improve solution quality and computational efficiency by leveraging rank-one quadratic formulations, outperforming existing methods.
Contribution
It develops stronger, more general convex relaxations for sparse regression based on rank-one formulations, enhancing solution accuracy and interpretability.
Findings
Relaxations solved within seconds on benchmark datasets.
Achieved near-optimal solutions with 0.4% optimality gap.
Outperformed alternative convex approaches in prediction accuracy.
Abstract
Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance. However, the exact model of sparse regression with an constraint restricting the support of the estimators is a challenging (\NP-hard) non-convex optimization problem. In this paper, we derive new strong convex relaxations for sparse regression. These relaxations are based on the ideal (convex-hull) formulations for rank-one quadratic terms with indicator variables. The new relaxations can be formulated as semidefinite optimization problems in an extended space and are stronger and more general than the state-of-the-art formulations, including the perspective reformulation and formulations with the reverse Huber penalty and the minimax concave penalty functions. Furthermore, the proposed rank-one strengthening can be interpreted as a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Statistical Methods and Inference · Multi-Criteria Decision Making
MethodsInterpretability
