English
Related papers

Related papers: Handling correlated and repeated measurements with…

200 papers

In high dimension, it is customary to consider Lasso-type estimators to enforce sparsity. For standard Lasso theory to hold, the regularization parameter should be proportional to the noise level, yet the latter is generally unknown in…

Machine Learning · Statistics 2017-10-19 Mathurin Massias , Olivier Fercoq , Alexandre Gramfort , Joseph Salmon

In high dimensional sparse regression, pivotal estimators are estimators for which the optimal regularization parameter is independent of the noise level. The canonical pivotal estimator is the square-root Lasso, formulated along with its…

Machine Learning · Statistics 2020-09-04 Mathurin Massias , Quentin Bertrand , Alexandre Gramfort , Joseph Salmon

In high dimensional settings, sparse structures are crucial for efficiency, both in term of memory, computation and performance. It is customary to consider $\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity enforcing methods,…

Machine Learning · Statistics 2017-11-22 Eugene Ndiaye , Olivier Fercoq , Alexandre Gramfort , Vincent Leclère , Joseph Salmon

Scaled sparse linear regression jointly estimates the regression coefficients and noise level in a linear model. It chooses an equilibrium with a sparse regression method by iteratively estimating the noise level via the mean residual…

Machine Learning · Statistics 2012-06-22 Tingni Sun , Cun-Hui Zhang

The Lasso is an attractive technique for regularization and variable selection for high-dimensional data, where the number of predictor variables $p_n$ is potentially much larger than the number of samples $n$. However, it was recently…

Statistics Theory · Mathematics 2009-03-02 Nicolai Meinshausen , Bin Yu

We propose a self-tuning $\sqrt{\mathrm {Lasso}}$ method that simultaneously resolves three important practical problems in high-dimensional regression analysis, namely it handles the unknown scale, heteroscedasticity and (drastic)…

Methodology · Statistics 2014-05-27 Alexandre Belloni , Victor Chernozhukov , Lie Wang

The popular Lasso approach for sparse estimation can be derived via marginalization of a joint density associated with a particular stochastic model. A different marginalization of the same probabilistic model leads to a different…

Machine Learning · Statistics 2013-02-28 Aleksandr Y. Aravkin , James V. Burke , Alessandro Chiuso , Gianluigi Pillonetto

Signal estimation problems with smoothness and sparsity priors can be naturally modeled as quadratic optimization with $\ell_0$-"norm" constraints. Since such problems are non-convex and hard-to-solve, the standard approach is, instead, to…

Machine Learning · Statistics 2020-10-20 Alper Atamturk , Andres Gomez , Shaoning Han

There has been much recent work on inference after model selection when the noise level is known, however, $\sigma$ is rarely known in practice and its estimation is difficult in high-dimensional settings. In this work we propose using the…

Statistics Theory · Mathematics 2017-02-13 Xiaoying Tian , Joshua R. Loftus , Jonathan E. Taylor

Modern technologies are producing a wealth of data with complex structures. For instance, in two-dimensional digital imaging, flow cytometry, and electroencephalography, matrix type covariates frequently arise when measurements are obtained…

Methodology · Statistics 2013-10-22 Hua Zhou , Lexin Li

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 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

The Lasso is a method for high-dimensional regression, which is now commonly used when the number of covariates $p$ is of the same order or larger than the number of observations $n$. Classical asymptotic normality theory does not apply to…

Statistics Theory · Mathematics 2023-09-20 Michael Celentano , Andrea Montanari , Yuting Wei

Sparse linear regression methods such as Lasso require a tuning parameter that depends on the noise variance, which is typically unknown and difficult to estimate in practice. In the presence of heavy-tailed noise or adversarial outliers,…

Statistics Theory · Mathematics 2025-06-17 Takeyuki Sasai , Hironori Fujisawa

Variance estimation in the linear model when $p > n$ is a difficult problem. Standard least squares estimation techniques do not apply. Several variance estimators have been proposed in the literature, all with accompanying asymptotic…

Methodology · Statistics 2014-01-30 Stephen Reid , Robert Tibshirani , Jerome Friedman

Nonparametric methods are widely applicable to statistical inference problems, since they rely on a few modeling assumptions. In this context, the fresh look advocated here permeates benefits from variable selection and compressive…

Machine Learning · Statistics 2015-03-19 Gonzalo Mateos , Georgios B. Giannakis

Performance of regularized least-squares estimation in noisy compressed sensing is analyzed in the limit when the dimensions of the measurement matrix grow large. The sensing matrix is considered to be from a class of random ensembles that…

Information Theory · Computer Science 2016-02-08 Mikko Vehkapera , Yoshiyuki Kabashima , Saikat Chatterjee

The Lasso has become a benchmark data analysis procedure, and numerous variants have been proposed in the literature. Although the Lasso formulations are stated so that overall prediction error is optimized, no full control over the…

High-dimensional regression often suffers from heavy-tailed noise and outliers, which can severely undermine the reliability of least-squares based methods. To improve robustness, we adopt a non-smooth Wilcoxon score based rank objective…

Machine Learning · Statistics 2026-01-29 Meixia Lin , Meijiao Shi , Yunhai Xiao , Qian Zhang

We consider the least-squares regression problem with unknown noise variance, where the observed data points are allowed to be corrupted by outliers. Building on the median-of-means (MOM) method introduced by Lecue and Lerasle…

Statistics Theory · Mathematics 2021-03-19 G. Finocchio , A. Derumigny , K. Proksch
‹ Prev 1 2 3 10 Next ›