paper-with-me

홈 › Papers

A Stable Lasso

2025-11-04 · Mahdi Nouraie, Houying Zhu, Samuel Muller arxiv

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 simple 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.

📄 PDF Abstract BibTeX arXiv:2511.02306

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Stable Feature Selection from Brain sMRI

2015-03-25 · Bo Xin, Lingjing Hu, Yizhou Wang, Wen Gao

Neuroimage analysis usually involves learning thousands or even millions of variables using only a limited number of samples. In this regard, sparse models, e.g. the lasso, are applied to select the optimal features and …

feature selection

Adaptive Class Preserving Representation for Image Classification

2017-07-01 · CVPR 2017 7 · Jian-Xun Mi, Qiankun Fu, Weisheng Li

In linear representation-based image classification, an unlabeled sample is represented by the entire training set. To obtain a stable and discriminative solution, regularization on the vector of representation coefficie…

ClassificationGeneral Classificationimage-classificationImage Classification+1

Rademacher upper bounds for cross-validation errors with an application to the lasso

2020-07-30 · Ning Xu, Timothy C. G. Fisher, Jian Hong

We establish a general upper bound for $K$-fold cross-validation ($K$-CV) errors that can be adapted to many $K$-CV-based estimators and learning algorithms. Based on Rademacher complexity of the model and the Orlicz-$\P…

BlockingVariable Selection

On an improvement of LASSO by scaling

2018-08-22 · Katsuyuki Hagiwara

A sparse modeling is a major topic in machine learning and statistics. LASSO (Least Absolute Shrinkage and Selection Operator) is a popular sparse modeling method while it has been known to yield unexpected large bias es…

Model Selection

GRASP: group-Shapley feature selection for patients

2026-02-11 · Yuheng Luo, Shuyan Li, Zhong Cao arxiv

Feature selection remains a major challenge in medical prediction, where existing approaches such as LASSO often lack robustness and interpretability. We introduce GRASP, a novel framework that couples Shapley value driv…