Open Source
A Stable Lasso
arXiv stat.CO0 views
arXiv:2511.02306v2 Announce Type: replace-cross Abstract: The Lasso has been widely used as a method for variable selection, valued for its simplicity and empirical performance. However, Lasso's selection stability deteriorates in the presence of correlated predictors. Several approaches have been developed to mitigate this limitation. In this paper, we provide a brief review of existing approaches, highlighting their limitations. We then propose a technique to improve the selection stability of Lasso by integrating a weighting scheme into the Lasso penalty function, where the weights are defined as an increasing function of a correlation-adjusted ranking that reflects the predictive power of predictors. Empirical evaluations on both simulated and real-world datasets demonstrate the efficacy of the proposed method. Additional numerical results demonstrate the effectiveness of the proposed approach in stabilizing other regularization-based selection methods, indicating its potential as a general-purpose solution.
Source:https://arxiv.org/abs/2511.02306PreviousScalable Bayesian Clustering for Integrative Analysis of Multi-View DataNextErgodic Central limit theorem for subgeometric Markov chains
Related posts

Forecasting the U.S. Senate with Prediction Markets and Monte Carlo Simulations
0dev.to AI
VoiceStudio: open-source, fully-local ElevenLabs alternative
0Hacker News New
Show HN: X Mode – macOS-style window management for Omarchy
0Hacker News Show
Show HN: Orca Style Workspaces for Herdr
0Hacker News Show
Supermarket freezers across Europe hit by second suspected cyber-attack
0Hacker News
AWS FinOps Field Notes (2026-11-02): Eliminating Idle NAT Gateways & Unattached EIPs with Python
0dev.to AWS