One-step estimator paths for concave regularization
Matt Taddy

TL;DR
This paper introduces POSE, a fast algorithm for sparse diminishing-bias regularization that adapts lasso paths with coefficient-specific weights, improving estimation accuracy without extra computational cost.
Contribution
It proposes a new one-step estimator path framework that enhances lasso regularization with adaptive weights, enabling better sparse diminishing-bias estimation efficiently.
Findings
POSE performs comparably or better than existing methods in simulations.
The gamma lasso implementation provides reliable degrees of freedom estimates.
Application to hockey data demonstrates practical utility.
Abstract
The statistics literature of the past 15 years has established many favorable properties for sparse diminishing-bias regularization: techniques which can roughly be understood as providing estimation under penalty functions spanning the range of concavity between and norms. However, lasso -regularized estimation remains the standard tool for industrial `Big Data' applications because of its minimal computational cost and the presence of easy-to-apply rules for penalty selection. In response, this article proposes a simple new algorithm framework that requires no more computation than a lasso path: the path of one-step estimators (POSE) does penalized regression estimation on a grid of decreasing penalties, but adapts coefficient-specific weights to decrease as a function of the coefficient estimated in the previous path step. This provides sparse diminishing-bias…
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
TopicsStatistical Methods and Inference · Advanced Statistical Methods and Models · Gaussian Processes and Bayesian Inference
