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:2510. 11546v3 Announce Type: replace-cross Abstract: High-dimensional regression often suffers from heavy-tailed noise and outliers, which can severely undermine the reliability of least-squares based methods.
By Meixia Lin, Mengjiao Shi, Yunhai Xiao, Qian Zhang
arXiv:2610.08345v1 Announce Type: cross
Abstract: Using a replica-symmetric high-dimensional characterization, we develop an inferential framework for sparse support vector machines when the sample s...
By Peng Zeng, Hanwen Huang
arXiv:2610. 29425v1 Announce Type: new Abstract: Understanding generalization of randomized learning algorithms remains a central challenge.
By Mohammad Hossein Momeni Hamaneh, Mohammad Mahdi Mojahedian, Mohammad Hossein Yassaee
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
arXiv:2606. 11738v1 Announce Type: cross Abstract: We study online estimation for high-dimensional generalized linear models with streaming data.
By Junzhuo Gao, Ling Peng, Xu Guo, Heng Lian