arXiv Machine Learning By Jingbo Liu

Stability of a Generalized Debiased Lasso with Applications to Resampling-Based Variable Selection

Read the original on arXiv Machine Learning →

arXiv:2405. 03063v3 Announce Type: replace-cross Abstract: We propose a generalized debiased Lasso estimator based on a stability principle.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Statistics ML
Oct 19

Cointegrated Regressors: Where Folded Concave Penalties Go Beyond LASSO

The paper discusses the limitations of LASSO in high‑dimensional regression models when cointegrated regressors are present, noting that the convex penalty can overly shrink their coefficients and lead to inconsistent estimation. It proposes using folded concave penalties (FCP), such as SCAD and MCP, to overcome this issue, establishing both local and global oracle properties for the penalized regression. Simulation results and an application to euro area unemployment forecasting demonstrate that FCP improves variable selection and out‑of‑sample prediction compared to LASSO.

By Hongqi Chen, Chengwang Liao, Ziwei Mei, Zhentao Shi
arXiv Machine Learning
Jul 7

Adversarial LassoNet: Robust Feature Selection via Stability-Driven Sparse Learning

arXiv:2607. 03839v1 Announce Type: new Abstract: Sparse feature selection is critical for high-dimensional machine learning, yet traditional $\ell_1$-regularized methods are often brittle under observational noise and spurious correlations, leading to unstable feature supports and degraded generalization.

By Zhen Huang, Peicheng Xu, Junbiao Pang, Yulong Zheng