The Sparsity of LASSO-type Minimizers

09/12/2022
by   Simon Foucart, et al.
0

This note extends an attribute of the LASSO procedure to a whole class of related procedures, including square-root LASSO, square LASSO, LAD-LASSO, and an instance of generalized LASSO. Namely, under the assumption that the input matrix satisfies an ℓ_p-restricted isometry property (which in some sense is weaker than the standard ℓ_2-restricted isometry property assumption), it is shown that if the input vector comes from the exact measurement of a sparse vector, then the minimizer of any such LASSO-type procedure has sparsity comparable to the sparsity of the measured vector. The result remains valid in the presence of moderate measurement error when the regularization parameter is not too small.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2014

Near-Ideal Behavior of Compressed Sensing Algorithms

In a recent paper, it is shown that the LASSO algorithm exhibits "near-i...
research
03/27/2023

Square Root LASSO: Well-posedness, Lipschitz stability and the tuning trade off

This paper studies well-posedness and parameter sensitivity of the Squar...
research
09/21/2012

A Note on the SPICE Method

In this article, we analyze the SPICE method developed in [1], and estab...
research
12/03/2019

Decentralised Sparse Multi-Task Regression

We consider a sparse multi-task regression framework for fitting a colle...
research
07/23/2021

A note on sharp oracle bounds for Slope and Lasso

In this paper, we study the sharp oracle bounds for Slope and Lasso and ...
research
04/11/2020

Generic Error Bounds for the Generalized Lasso with Sub-Exponential Data

This work performs a non-asymptotic analysis of the (constrained) genera...
research
11/10/2017

A Theoretical Analysis of Sparse Recovery Stability of Dantzig Selector and LASSO

Dantzig selector (DS) and LASSO problems have attracted plenty of attent...

Please sign up or login with your details

Forgot password? Click here to reset