SURE-tuned Bridge Regression
Jorge Lor\'ia, Anindya Bhadra

TL;DR
This paper introduces a fast, non-iterative method for Bridge regression that uses an explicit Stein's unbiased risk estimate to select tuning parameters, significantly reducing computation time while maintaining statistical accuracy.
Contribution
The authors develop a novel explicit formula for Stein's unbiased risk estimate for Bridge regression, enabling efficient tuning parameter selection without iterative procedures or MCMC.
Findings
Significantly faster computation compared to traditional methods.
Maintains comparable statistical performance to existing approaches.
Provides an open-source R implementation for practical use.
Abstract
Consider the {} regularized linear regression, also termed Bridge regression. For , Bridge regression enjoys several statistical properties of interest such as sparsity and near-unbiasedness of the estimates (Fan and Li, 2001). However, the main difficulty lies in the non-convex nature of the penalty for these values of , which makes an optimization procedure challenging and usually it is only possible to find a local optimum. To address this issue, Polson et al. (2013) took a sampling based fully Bayesian approach to this problem, using the correspondence between the Bridge penalty and a power exponential prior on the regression coefficients. However, their sampling procedure relies on Markov chain Monte Carlo (MCMC) techniques, which are inherently sequential and not scalable to large problem dimensions. Cross validation approaches are similarly…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Stochastic Gradient Optimization Techniques · Sparse and Compressive Sensing Techniques
