English
Related papers

Related papers: Sparse Recovery with Shuffled Labels: Statistical …

200 papers

The recovery of signals with finite-valued components from few linear measurements is a problem with widespread applications and interesting mathematical characteristics. In the compressed sensing framework, tailored methods have been…

Optimization and Control · Mathematics 2019-07-24 Sophie M. Fosson , Mohammad Abuabiah

The performance of estimating the common support for jointly sparse signals based on their projections onto lower-dimensional space is analyzed. Support recovery is formulated as a multiple-hypothesis testing problem. Both upper and lower…

Information Theory · Computer Science 2009-11-05 Gongguo Tang , Arye Nehorai

We consider the following signal recovery problem: given a measurement matrix $\Phi\in \mathbb{R}^{n\times p}$ and a noisy observation vector $c\in \mathbb{R}^{n}$ constructed from $c = \Phi\theta^* + \epsilon$ where $\epsilon\in…

Machine Learning · Statistics 2013-07-23 Ji Liu , Lei Yuan , Jieping Ye

The recovery of unknown signals from quadratic measurements finds extensive applications in fields such as phase retrieval, power system state estimation, and unlabeled distance geometry. This paper investigates the finite sample properties…

Statistics Theory · Mathematics 2026-04-15 Jun Fan , Jingyu Yang , Xinyu Zhang , Liqun Wang

Support recovery of sparse signals from noisy measurements with orthogonal matching pursuit (OMP) has been extensively studied in the literature. In this paper, we show that for any $K$-sparse signal $\x$, if the sensing matrix $\A$…

Information Theory · Computer Science 2018-07-13 JInming Wen , Zhengchun Zhou , Jian Wang , Xiaohu Tang , Qun Mo

We propose novel necessary and sufficient conditions for a sensing matrix to be "$s$-good" - to allow for exact $\ell_1$-recovery of sparse signals with $s$ nonzero entries when no measurement noise is present. Then we express the error…

Optimization and Control · Mathematics 2014-04-11 Anatoli Juditsky , Arkadii S. Nemirovski

The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…

Information Theory · Computer Science 2011-09-29 Lianlin Li

Shuffled linear regression (SLR) seeks to estimate latent features through a linear transformation, complicated by unknown permutations in the measurement dimensions. This problem extends traditional least-squares (LS) and Least Absolute…

Statistics Theory · Mathematics 2025-04-17 Hang Liu , Anna Scaglione

We derived the first sparse recovery guarantees for weighted $\ell_1$ minimization with sparse random matrices and the class of weighted sparse signals, using a weighted versions of the null space property to derive these guarantees. These…

Numerical Analysis · Mathematics 2016-05-10 Bubacarr Bah

The support recovery problem consists of determining a sparse subset of variables that is relevant in generating a set of observations. In this paper, we study the support recovery problem in the phase retrieval model consisting of noisy…

Information Theory · Computer Science 2020-09-29 Lan V. Truong , Jonathan Scarlett

The problem of estimating a sparse signal from low dimensional noisy observations arises in many applications, including super resolution, signal deconvolution, and radar imaging. In this paper, we consider a sparse signal model with…

Information Theory · Computer Science 2020-06-24 Youye Xie , Michael B. Wakin , Gongguo Tang

In this paper, we study the problem of sparse mixed linear regression on an unlabeled dataset that is generated from linear measurements from two different regression parameter vectors. Since the data is unlabeled, our task is not only to…

Machine Learning · Computer Science 2022-09-12 Adarsh Barik , Jean Honorio

The stability of sparse signal reconstruction is investigated in this paper. We design efficient algorithms to verify the sufficient condition for unique $\ell_1$ sparse recovery. One of our algorithm produces comparable results with the…

Information Theory · Computer Science 2015-05-18 Gongguo Tang , Arye Nehorai

We address the recovery of sparse vectors in an overcomplete, linear and noisy multiple measurement framework, where the measurement matrix is known upto a permutation of its rows. We derive sparse Bayesian learning (SBL) based updates for…

Information Theory · Computer Science 2018-02-05 Ranjitha Prasad

We consider the recovery of regression coefficients, denoted by $\boldsymbol{\beta}_0$, for a single index model (SIM) relating a binary outcome $Y$ to a set of possibly high dimensional covariates $\boldsymbol{X}$, based on a large but…

Methodology · Statistics 2018-07-03 Abhishek Chakrabortty , Matey Neykov , Raymond Carroll , Tianxi Cai

We consider the problem of recovering the support of a sparse signal using noisy projections. While extensive work has been done on the dense measurement matrix setting, the sparse setting remains less explored. In this work, we establish…

Machine Learning · Statistics 2025-09-03 Youssef Chaabouni , David Gamarnik

We provide novel sufficient conditions for the uniform recovery of sparse Legendre expansions using $\ell_1$ minimization, where the sampling points are drawn according to orthogonalization (uniform) measure. So far, conditions of the form…

Numerical Analysis · Mathematics 2018-10-09 Hoang Tran , Clayton Webster

We consider the problem of exact support recovery of sparse signals via noisy measurements. The main focus is the sufficient and necessary conditions on the number of measurements for support recovery to be reliable. By drawing an analogy…

Information Theory · Computer Science 2010-03-04 Yuzhe Jin , Young-Han Kim , Bhaskar D. Rao

We investigate the sparse recovery problem of reconstructing a high-dimensional non-negative sparse vector from lower dimensional linear measurements. While much work has focused on dense measurement matrices, sparse measurement schemes are…

Information Theory · Computer Science 2009-02-25 M. Amin Khajehnejad , Alexandros G. Dimakis , Weiyu Xu , Babak Hassibi

From a numerical analysis perspective, assessing the robustness of l1-minimization is a fundamental issue in compressed sensing and sparse regularization. Yet, the recovery guarantees available in the literature usually depend on a priori…

Numerical Analysis · Mathematics 2017-05-10 Simone Brugiapaglia , Ben Adcock , Richard K. Archibald