English
Related papers

Related papers: Thresholded Basis Pursuit: An LP Algorithm for Ach…

200 papers

In this paper, we consider the mixture of sparse linear regressions model. Let ${\beta}^{(1)},\ldots,{\beta}^{(L)}\in\mathbb{C}^n$ be $ L $ unknown sparse parameter vectors with a total of $ K $ non-zero coefficients. Noisy linear…

Information Theory · Computer Science 2018-08-03 Dong Yin , Ramtin Pedarsani , Yudong Chen , Kannan Ramchandran

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

We introduce a general framework to handle structured models (sparse and block-sparse with possibly overlapping blocks). We discuss new methods for their recovery from incomplete observation, corrupted with deterministic and stochastic…

Statistics Theory · Mathematics 2013-02-28 Anatoli Juditsky , Fatma Kılınç Karzan , Arkadi Nemirovski , Boris Polyak

Compressed sensing has a wide range of applications that include error correction, imaging, radar and many more. Given a sparse signal in a high dimensional space, one wishes to reconstruct that signal accurately and efficiently from a…

Numerical Analysis · Mathematics 2009-05-28 Deanna Needell

Sparse signal recovery from a small number of random measurements is a well known NP-hard to solve combinatorial optimization problem, with important applications in signal and image processing. The standard approach to the sparse signal…

Data Analysis, Statistics and Probability · Physics 2013-04-09 M. Andrecut

This paper considers the noisy sparse phase retrieval problem: recovering a sparse signal $x \in \mathbb{R}^p$ from noisy quadratic measurements $y_j = (a_j' x )^2 + \epsilon_j$, $j=1, \ldots, m$, with independent sub-exponential noise…

Statistics Theory · Mathematics 2015-06-11 T. Tony Cai , Xiaodong Li , Zongming Ma

Matching Pursuit LASSIn Part I \cite{TanPMLPart1}, a Matching Pursuit LASSO ({MPL}) algorithm has been presented for solving large-scale sparse recovery (SR) problems. In this paper, we present a subspace search to further improve the…

Computer Vision and Pattern Recognition · Computer Science 2014-12-25 Mingkui Tan , Ivor W. Tsang , Li Wang

Sparse recovery is one of the most fundamental and well-studied inverse problems. Standard statistical formulations of the problem are provably solved by general convex programming techniques and more practical, fast (nearly-linear time)…

Data Structures and Algorithms · Computer Science 2022-03-09 Jonathan A. Kelner , Jerry Li , Allen Liu , Aaron Sidford , Kevin Tian

We consider compressed sensing of block-sparse signals, i.e., sparse signals that have nonzero coefficients occuring in clusters. Based on an uncertainty relation for block-sparse signals, we define a block-coherence measure and we show…

Information Theory · Computer Science 2008-12-02 Yonina C. Eldar , Helmut Bolcskei

Recovering a sparse signal from outlier-contaminated measurements is a fundamental challenge in many applications. While existing algorithms predominantly address scenarios with bounded noise or assume known signal sparsity, few methods…

Information Theory · Computer Science 2026-03-09 Jiao Xu , Peng Li , Bing Zheng

Affine phase retrieval is the problem of recovering signals from the magnitude-only measurements with a priori information. In this paper, we use the $\ell_1$ minimization to exploit the sparsity of signals for affine phase retrieval,…

Information Theory · Computer Science 2022-09-20 Meng Huang , Shixiang Sun , Zhiqiang Xu

We consider sparse variants of the classical Learning Parities with random Noise (LPN) problem. Our main contribution is a new algorithmic framework that provides learning algorithms against low-noise for both Learning Sparse Parities…

Cryptography and Security · Computer Science 2025-06-03 Xue Chen , Wenxuan Shu , Zhaienhe Zhou

We investigate conditions for the unique recoverability of sparse integer-valued signals from a small number of linear measurements. Both the objective of minimizing the number of nonzero components, the so-called $\ell_0$-norm, as well as…

Information Theory · Computer Science 2019-09-18 Jan-Hendrik Lange , Marc E. Pfetsch , Bianca M. Seib , Andreas M. Tillmann

The problem of consistently estimating the sparsity pattern of a vector $\betastar \in \real^\mdim$ based on observations contaminated by noise arises in various contexts, including subset selection in regression, structure estimation in…

Statistics Theory · Mathematics 2007-07-13 Martin J. Wainwright

This paper considers the exact recovery of $k$-sparse signals in the noiseless setting and support recovery in the noisy case when some prior information on the support of the signals is available. This prior support consists of two parts.…

Information Theory · Computer Science 2017-06-30 Huanmin Ge , Wengu Chen

The phase retrieval problem asks to recover a natural signal $y_0 \in \mathbb{R}^n$ from $m$ quadratic observations, where $m$ is to be minimized. As is common in many imaging problems, natural signals are considered sparse with respect to…

Information Theory · Computer Science 2018-07-12 Paul Hand , Oscar Leong , Vladislav Voroninski

Given a linear system in a real or complex domain, linear regression aims to recover the model parameters from a set of observations. Recent studies in compressive sensing have successfully shown that under certain conditions, a linear…

Statistics Theory · Mathematics 2016-11-15 Henrik Ohlsson , Allen Y. Yang , Roy Dong , S. Shankar Sastry

We consider the problem of exact recovery of a $k$-sparse binary vector from generalized linear measurements (such as logistic regression). We analyze the linear estimation algorithm (Plan, Vershynin, Yudovina, 2017), and also show…

Machine Learning · Statistics 2025-02-25 Arya Mazumdar , Neha Sangwan

We study the problem of recovering the sparsity pattern of block-sparse signals from noise-corrupted measurements. A simple, efficient recovery method, namely, a block-version of the orthogonal matching pursuit (OMP) method, is considered…

Information Theory · Computer Science 2011-09-27 Jun Fang , Hongbin Li

Sparse modeling has been widely and successfully used in many applications such as computer vision, machine learning, and pattern recognition. Accompanied with those applications, significant research has studied the theoretical limits and…

Information Theory · Computer Science 2016-10-04 Yuki Itoh , Marco F. Duarte , Mario Parente