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: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
arXiv:2606. 06855v1 Announce Type: cross Abstract: While algorithmic stability is a central tool for understanding generalization of learning algorithms, existing high-probability guarantees typically rely on uniform boundedness or sub-Gaussian/sub-Weibull tail assumptions, which can be overly restrictive for modern settings with heavy-tailed or unbounded losses.
By Qianqian Lei, Soham Bonnerjee, Yuefeng Han, Wei Biao Wu
arXiv:2606. 23867v1 Announce Type: new Abstract: The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.
By Trenton Lau, Gary P. T. Choi
arXiv:2511. 15615v2 Announce Type: replace-cross Abstract: This paper presents a tractable algorithm for estimating an unknown Lipschitz function from noisy observations and establishes an upper bound on its convergence rate.
By G\'abor Bal\'azs