English
Related papers

Related papers: Lasso and Partially-Rotated Designs

200 papers

Meinshausen and Buhlmann [Ann. Statist. 34 (2006) 1436--1462] showed that, for neighborhood selection in Gaussian graphical models, under a neighborhood stability condition, the LASSO is consistent, even when the number of variables is of…

Statistics Theory · Mathematics 2008-08-08 Cun-Hui Zhang , Jian Huang

We consider a high dimensional linear regression problem where the goal is to efficiently recover an unknown vector $\beta^*$ from $n$ noisy linear observations $Y=X\beta^*+W \in \mathbb{R}^n$, for known $X \in \mathbb{R}^{n \times p}$ and…

Statistics Theory · Mathematics 2018-11-12 David Gamarnik , Ilias Zadik

We consider linear regression in the high-dimensional regime where the number of observations $n$ is smaller than the number of parameters $p$. A very successful approach in this setting uses $\ell_1$-penalized least squares (a.k.a. the…

Methodology · Statistics 2014-02-05 Adel Javanmard , Andrea Montanari

Sparse linear regression is a central problem in high-dimensional statistics. We study the correlated random design setting, where the covariates are drawn from a multivariate Gaussian $N(0,\Sigma)$, and we seek an estimator with small…

Data Structures and Algorithms · Computer Science 2023-05-29 Jonathan Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

A sparse modeling is a major topic in machine learning and statistics. LASSO (Least Absolute Shrinkage and Selection Operator) is a popular sparse modeling method while it has been known to yield unexpected large bias especially at a sparse…

Machine Learning · Computer Science 2018-08-23 Katsuyuki Hagiwara

It is well-known that the statistical performance of Lasso can suffer significantly when the covariates of interest have strong correlations. In particular, the prediction error of Lasso becomes much worse than computationally inefficient…

Machine Learning · Statistics 2024-02-26 Jonathan Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

We address the issue of estimating the regression vector $\beta$ in the generic $s$-sparse linear model $y = X\beta+z$, with $\beta\in\R^{p}$, $y\in\R^{n}$, $z\sim\mathcal N(0,\sg^2 I)$ and $p> n$ when the variance $\sg^{2}$ is unknown. We…

Statistics Theory · Mathematics 2012-11-06 Stéphane Chrétien , Sébastien Darses

When the design matrix has orthonormal columns, "soft thresholding" the ordinary least squares (OLS) solution produces the Lasso solution [Tibshirani, 1996]. If one uses the Puffer preconditioned Lasso [Jia and Rohe, 2012], then this result…

Machine Learning · Statistics 2014-12-04 Karl Rohe

We consider high-dimensional inference for potentially misspecified Cox proportional hazard models based on low dimensional results by Lin and Wei [1989]. A de-sparsified Lasso estimator is proposed based on the log partial likelihood…

Statistics Theory · Mathematics 2018-11-02 Shengchun Kong , Zhuqing Yu , Xianyang Zhang , Guang Cheng

For multiple index models, it has recently been shown that the sliced inverse regression (SIR) is consistent for estimating the sufficient dimension reduction (SDR) space if and only if $\rho=\lim\frac{p}{n}=0$, where $p$ is the dimension…

Statistics Theory · Mathematics 2018-06-19 Qian Lin , Zhigen Zhao , Jun S. Liu

We consider the least-square linear regression problem with regularization by the $\ell^1$-norm, a problem usually referred to as the Lasso. In this paper, we first present a detailed asymptotic analysis of model consistency of the Lasso in…

Machine Learning · Computer Science 2009-01-22 Francis Bach

In this paper, we revisit the regret minimization problem in sparse stochastic contextual linear bandits, where feature vectors may be of large dimension $d$, but where the reward function depends on a few, say $s_0\ll d$, of these features…

Machine Learning · Statistics 2022-06-22 Kaito Ariu , Kenshi Abe , Alexandre Proutière

In high-dimensional sparse regression, the \textsc{Lasso} estimator offers excellent theoretical guarantees but is well-known to produce biased estimates. To address this, \cite{Javanmard2014} introduced a method to ``debias" the…

Machine Learning · Statistics 2025-02-28 Shuvayan Banerjee , James Saunderson , Radhendushka Srivastava , Ajit Rajwade

The goal of predictive sparse coding is to learn a representation of examples as sparse linear combinations of elements from a dictionary, such that a learned hypothesis linear in the new representation performs well on a predictive task.…

Machine Learning · Computer Science 2012-10-09 Nishant A. Mehta , Alexander G. Gray

In high-dimensional statistical inference in which the number of parameters to be estimated is larger than that of the holding data, regularized linear estimation techniques are widely used. These techniques have, however, some drawbacks.…

Methodology · Statistics 2025-08-06 Takashi Takahashi , Yoshiyuki Kabashima

We study a high-dimensional regression model. Aim is to construct a confidence set for a given group of regression coefficients, treating all other regression coefficients as nuisance parameters. We apply a one-step procedure with the…

Statistics Theory · Mathematics 2015-09-16 Sara van de Geer , Benjamin Stucky

We present a detailed analysis of the unconstrained $\ell_1$-weighted LASSO method for recovery of sparse data from its observation by randomly generated matrices, satisfying the Restricted Isometry Property (RIP) with constant $\delta<1$,…

Information Theory · Computer Science 2022-03-16 Simon Foucart , Eitan Tadmor , Ming Zhong

Discovering the partial differential equations underlying spatio-temporal datasets from very limited and highly noisy observations is of paramount interest in many scientific fields. However, it remains an open question to know when model…

Machine Learning · Statistics 2021-10-06 Georges Tod , Gert-Jan Both , Remy Kusters

Beta regression is commonly employed when the outcome variable is a proportion. Since its conception, the approach has been widely used in applications spanning various scientific fields. A series of extensions have been proposed over time,…

Methodology · Statistics 2025-07-29 Niloofar Ramezani , Martin Slawski

We leverage recent advances in high-dimensional statistics to derive new L2 estimation upper bounds for Lasso and Group Lasso in high-dimensions. For Lasso, our bounds scale as $(k^*/n) \log(p/k^*)$---$n\times p$ is the size of the design…

Machine Learning · Statistics 2020-02-27 Antoine Dedieu