English
Related papers

Related papers: Degrees of freedom in lasso problems

200 papers

In sparse regression modeling via regularization such as the lasso, it is important to select appropriate values of tuning parameters including regularization parameters. The choice of tuning parameters can be viewed as a model selection…

Methodology · Statistics 2012-01-05 Kei Hirose , Shohei Tateishi , Sadanori Konishi

In this paper we study the effective degrees of freedom of a general class of reduced rank estimators for multivariate regression in the framework of Stein's unbiased risk estimation (SURE). We derive a finite-sample exact unbiased…

Methodology · Statistics 2013-04-23 Ashin Mukherjee , Kun Chen , Naisyin Wang , Ji Zhu

We consider the question of counting the degrees of freedom in theoretical models, with an emphasis on theories of fields and gravity. Among the possible approaches, the Hamiltonian formulation remains one of the most systematic and robust…

High Energy Physics - Theory · Physics 2026-01-16 Anamaria Hell , Elisa G. M. Ferreira , Dieter Lust , Misao Sasaki

This paper examines LASSO, a widely-used $L_{1}$-penalized regression method, in high dimensional linear predictive regressions, particularly when the number of potential predictors exceeds the sample size and numerous unit root regressors…

Econometrics · Economics 2024-01-17 Ziwei Mei , Zhentao Shi

The abundance of high-dimensional data in the modern sciences has generated tremendous interest in penalized estimators such as the lasso, scaled lasso, square-root lasso, elastic net, and many others. In this paper, we establish a general…

Statistics Theory · Mathematics 2018-03-14 Johannes Lederer , Lu Yu , Irina Gaynanova

We study uniqueness in the generalized lasso problem, where the penalty is the $\ell_1$ norm of a matrix $D$ times the coefficient vector. We derive a broad result on uniqueness that places weak assumptions on the predictor matrix $X$ and…

Statistics Theory · Mathematics 2019-05-14 Alnur Ali , Ryan J. Tibshirani

We present a new method for post-selection inference for L1 (lasso)-penalized likelihood models, including generalized regression models. Our approach generalizes the post-selection framework presented in Lee et al (2014). The method…

Methodology · Statistics 2016-10-17 Jonathan Taylor , Robert Tibshirani

We consider the problem of recovering conditional independence relationships between $p$ jointly distributed Hilbertian random elements given $n$ realizations thereof. We operate in the sparse high-dimensional regime, where $n \ll p$ and no…

Methodology · Statistics 2023-06-26 Kartik G. Waghmare , Tomas Masak , Victor M. Panaretos

In this paper we develop inference for high dimensional linear models, with serially correlated errors. We examine Lasso under the assumption of strong mixing in the covariates and error process, allowing for fatter tails in their…

Econometrics · Economics 2023-10-05 Ilias Chronopoulos , Katerina Chrysikou , George Kapetanios

We establish generalizations of Saito's criterion for the freeness of divisors in projective spaces that apply both to sequences of several homogeneous polynomials and to divisors on other complete varieties. As an application, the new…

Commutative Algebra · Mathematics 2024-08-06 Daniele Faenzi , Marcos Jardim , Jean Vallès

Regularized regression has become very popular nowadays, particularly on high-dimensional problems where the addition of a penalty term to the log-likelihood allows inference where traditional methods fail. A number of penalties have been…

Methodology · Statistics 2021-02-15 Hamed Haselimashhadi , Veronica Vinciotti

We consider high-dimensional generalized linear models with Lipschitz loss functions, and prove a nonasymptotic oracle inequality for the empirical risk minimizer with Lasso penalty. The penalty is based on the coefficients in the linear…

Statistics Theory · Mathematics 2008-12-18 Sara A. van de Geer

We present upper and lower bounds for the prediction error of the Lasso. For the case of random Gaussian design, we show that under mild conditions the prediction error of the Lasso is up to smaller order terms dominated by the prediction…

Statistics Theory · Mathematics 2018-04-04 Sara van de Geer

The Lasso is one of the most important approaches for parameter estimation and variable selection in high dimensional linear regression. At the heart of its success is the attractive rate of convergence result even when $p$, the dimension…

Statistics Theory · Mathematics 2019-08-09 Junlong Zhao , Chenlei Leng

Finite mixture regression models are useful for modeling the relationship between response and predictors, arising from different subpopulations. In this article, we study high-dimensional predic- tors and high-dimensional response, and…

Statistics Theory · Mathematics 2016-01-07 Emilie Devijver

In spite of the wealth of literature on the theoretical properties of the Lasso, there is very little known when the value of the tuning parameter is chosen using the data, even though this is what actually happens in practice. We give a…

Statistics Theory · Mathematics 2016-09-02 Sourav Chatterjee , Jafar Jafarov

For physical theories, the degree of arbitrariness of a system is of great importance, and is often closely linked to the concept of degree of freedom, and for most systems this number is far from obvious. In this paper we present an easy…

Mathematical Physics · Physics 2012-01-12 Ziyang Hu

The Lasso is a popular model selection and estimation procedure for linear models that enjoys nice theoretical properties. In this paper, we study the Lasso estimator for fitting autoregressive time series models. We adopt a double…

Statistics Theory · Mathematics 2008-05-09 Yuval Nardi , Alessandro Rinaldo

We study regularized estimation in high-dimensional longitudinal classification problems, using the lasso and fused lasso regularizers. The constructed coefficient estimates are piecewise constant across the time dimension in the…

In this paper, we are concerned with regression problems where covariates can be grouped in nonoverlapping blocks, and where only a few of them are assumed to be active. In such a situation, the group Lasso is an at- tractive method for…

Information Theory · Computer Science 2013-01-01 Samuel Vaiter , Charles Deledalle , Gabriel Peyré , Jalal Fadili , Charles Dossal