English
Related papers

Related papers: Sharp Trade-Offs in High-Dimensional Inference via…

200 papers

In this paper we consider high-dimensional multiclass classification by sparse multinomial logistic regression. We propose first a feature selection procedure based on penalized maximum likelihood with a complexity penalty on the model size…

Statistics Theory · Mathematics 2020-11-20 Felix Abramovich , Vadim Grinshtein , Tomer Levy

In sparse linear regression, the SLOPE estimator generalizes LASSO by penalizing different coordinates of the estimate according to their magnitudes. In this paper, we present a precise performance characterization of SLOPE in the…

Information Theory · Computer Science 2021-06-07 Hong Hu , Yue M. Lu

The paper considers a linear regression model in high-dimension for which the predictive variables can change the influence on the response variable at unknown times (called change-points). Moreover, the particular case of the heavy-tailed…

Statistics Theory · Mathematics 2013-07-03 Gabriela Ciuperca

High-dimensional prediction typically comprises two steps: variable selection and subsequent least-squares refitting on the selected variables. However, the standard variable selection procedures, such as the lasso, hinge on tuning…

Methodology · Statistics 2017-06-07 Didier Chételat , Johannes Lederer , Joseph Salmon

In this paper, for Lasso penalized linear regression models in high-dimensional settings, we propose a modified cross-validation method for selecting the penalty parameter. The methodology is extended to other penalties, such as Elastic…

Methodology · Statistics 2013-09-10 Yi Yu , Yang Feng

Lasso-type estimators are routinely used to estimate high-dimensional time series models. The theoretical guarantees established for these estimators typically require the penalty level to be chosen in a suitable fashion often depending on…

Penalized (or regularized) regression, as represented by Lasso and its variants, has become a standard technique for analyzing high-dimensional data when the number of variables substantially exceeds the sample size. The performance of…

Methodology · Statistics 2019-08-13 Yunan Wu , Lan Wang

The rule of thumb regarding the relationship between the bias-variance tradeoff and model size plays a key role in classical machine learning, but is now well-known to break down in the overparameterized setting as per the double descent…

Machine Learning · Statistics 2026-02-16 Qingyi Hu , Liam Hodgkinson

We propose a new sparsity-smoothness penalty for high-dimensional generalized additive models. The combination of sparsity and smoothness is crucial for mathematical theory as well as performance for finite-sample data. We present a…

Machine Learning · Statistics 2009-11-18 Lukas Meier , Sara van de Geer , Peter Bühlmann

Large reasoning models improve with more test-time computation, but often overthink, producing unnecessarily long chains-of-thought that raise cost without improving accuracy. Prior reinforcement learning approaches typically rely on a…

Computation and Language · Computer Science 2026-03-03 Xintong Li , Sha Li , Rongmei Lin , Hongye Jin , Linwei Li , Hejie Cui , Sarah Zhang , Chia-Yuan Chang , Kewei Cheng , Besnik Fetahu , Priyanka Nigam , Jingbo Shang , Bing Yin

High-dimensional sparse modeling via regularization provides a powerful tool for analyzing large-scale data sets and obtaining meaningful, interpretable models. The use of nonconvex penalty functions shows advantage in selecting important…

Methodology · Statistics 2016-05-12 Zemin Zheng , Yingying Fan , Jinchi Lv

We propose a new estimator, the thresholded scaled Lasso, in high dimensional threshold regressions. First, we establish an upper bound on the $\ell_\infty$ estimation error of the scaled Lasso estimator of Lee et al. (2012). This is a…

Methodology · Statistics 2015-02-11 Laurent Callot , Mehmet Caner , Anders Bredahl Kock , Juan Andres Riquelme

We consider the problem of simultaneous variable selection and estimation of the corresponding regression coefficients in an ultra-high dimensional linear regression models, an extremely important problem in the recent era. The adaptive…

Methodology · Statistics 2023-09-22 Abhik Ghosh , Maria Jaenada , Leandro Pardo

We consider the problem of mixed sparse linear regression with two components, where two real $k$-sparse signals $\beta_1, \beta_2$ are to be recovered from $n$ unlabelled noisy linear measurements. The sparsity is allowed to be sublinear…

Machine Learning · Statistics 2023-07-07 Gabriel Arpino , Ramji Venkataramanan

We consider the problem of automatic variable selection in a linear model with asymmetric or heavy-tailed errors when the number of explanatory variables diverges with the sample size. For this high-dimensional model, the penalized least…

Statistics Theory · Mathematics 2018-12-10 Gabriela Ciuperca

SLOPE is a popular method for dimensionality reduction in the high-dimensional regression. Indeed some regression coefficient estimates of SLOPE can be null (sparsity) or can be equal in absolute value (clustering). Consequently, SLOPE may…

In high-dimensional model selection problems, penalized simple least-square approaches have been extensively used. This paper addresses the question of both robustness and efficiency of penalized model selection methods, and proposes a…

Methodology · Statistics 2011-07-06 Jelena Bradic , Jianqing Fan , Weiwei Wang

Penalized likelihood approaches are widely used for high-dimensional regression. Although many methods have been proposed and the associated theory is now well-developed, the relative efficacy of different approaches in finite-sample…

Methodology · Statistics 2020-01-29 Fan Wang , Sach Mukherjee , Sylvia Richardson , Steven M. Hill

High-dimensional sparse modeling with censored survival data is of great practical importance, as exemplified by modern applications in high-throughput genomic data analysis and credit risk analysis. In this article, we propose a class of…

Methodology · Statistics 2014-03-19 Wei Lin , Jinchi Lv

A recently proposed SLOPE estimator (arXiv:1407.3824) has been shown to adaptively achieve the minimax $\ell_2$ estimation rate under high-dimensional sparse linear regression models (arXiv:1503.08393). Such minimax optimality holds in the…

Machine Learning · Statistics 2021-09-24 Shuaiwen Wang , Haolei Weng , Arian Maleki