Dictionary LASSO: Guaranteed Sparse Recovery under Linear Transformation

04/30/2013
by   Ji Liu, et al.
0

We consider the following signal recovery problem: given a measurement matrix Φ∈R^n× p and a noisy observation vector c∈R^n constructed from c = Φθ^* + ϵ where ϵ∈R^n is the noise vector whose entries follow i.i.d. centered sub-Gaussian distribution, how to recover the signal θ^* if Dθ^* is sparse under a linear transformation D∈R^m× p? One natural method using convex optimization is to solve the following problem: _θ1 2Φθ - c^2 + λDθ_1. This paper provides an upper bound of the estimate error and shows the consistency property of this method by assuming that the design matrix Φ is a Gaussian random matrix. Specifically, we show 1) in the noiseless case, if the condition number of D is bounded and the measurement number n≥Ω(s(p)) where s is the sparsity number, then the true solution can be recovered with high probability; and 2) in the noisy case, if the condition number of D is bounded and the measurement increases faster than s(p), that is, s(p)=o(n), the estimate error converges to zero with probability 1 when p and s go to infinity. Our results are consistent with those for the special case D=I_p× p (equivalently LASSO) and improve the existing analysis. The condition number of D plays a critical role in our analysis. We consider the condition numbers in two cases including the fused LASSO and the random graph: the condition number in the fused LASSO case is bounded by a constant, while the condition number in the random graph case is bounded with high probability if m p (i.e., #textedge #textvertex) is larger than a certain constant. Numerical simulations are consistent with our theoretical results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/22/2012

On pattern recovery of the fused Lasso

We study the property of the Fused Lasso Signal Approximator (FLSA) for ...
research
08/13/2018

Precise Performance Analysis of the LASSO under Matrix Uncertainties

In this paper, we consider the problem of recovering an unknown sparse s...
research
08/29/2019

Enhanced block sparse signal recovery based on q-ratio block constrained minimal singular values

In this paper we introduce the q-ratio block constrained minimal singula...
research
04/15/2020

Sampling Rates for ℓ^1-Synthesis

This work investigates the problem of signal recovery from undersampled ...
research
10/19/2020

Estimating Stochastic Linear Combination of Non-linear Regressions Efficiently and Scalably

Recently, many machine learning and statistical models such as non-linea...
research
02/25/2023

Average case analysis of Lasso under ultra-sparse conditions

We analyze the performance of the least absolute shrinkage and selection...
research
06/29/2022

Off-the-grid learning of sparse mixtures from a continuous dictionary

We consider a general non-linear model where the signal is a finite mixt...

Please sign up or login with your details

Forgot password? Click here to reset