Renet: Principled and Efficient Relaxation for the Elastic Net via Dynamic Objective Selection
Albert Dorador

TL;DR
Renet is a new method that improves Elastic Net regularization by dynamically adjusting the relaxation process, reducing bias, and enhancing prediction accuracy in high-dimensional settings.
Contribution
It introduces an adaptive relaxation framework that enforces sign consistency and synergizes with the 1-SE rule, outperforming standard Elastic Net in various regimes.
Findings
Renet outperforms standard Elastic Net in predictive accuracy.
It provides a robust debiasing mechanism via relaxation.
Renet maintains competitive computational efficiency.
Abstract
We introduce Renet, a principled generalization of the Relaxed Lasso to the Elastic Net family of estimators. While, on the one hand, -regularization is a standard tool for variable selection in high-dimensional regimes and, on the other hand, the penalty provides stability and solution uniqueness through strict convexity, the standard Elastic Net nevertheless suffers from shrinkage bias that frequently yields suboptimal prediction accuracy. We propose to address this limitation through a framework called \textit{relaxation}. Existing relaxation implementations rely on naive linear interpolations of penalized and unpenalized solutions, which ignore the non-linear geometry that characterizes the entire regularization path and risk violating the Karush-Kuhn-Tucker conditions. Renet addresses these limitations by enforcing sign consistency through an adaptive relaxation…
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
TopicsStochastic Gradient Optimization Techniques · Statistical Methods and Inference · Gaussian Processes and Bayesian Inference
