English
Related papers

Related papers: Improved Bounds on Restricted Isometry Constants f…

200 papers

Compressed sensing is the art of reconstructing a sparse vector from its inner products with respect to a small set of randomly chosen measurement vectors. It is usually assumed that the ensemble of measurement vectors is in isotropic…

Information Theory · Computer Science 2014-02-25 Richard Kueng , David Gross

This paper considers compressed sensing matrices and neighborliness of a centrally symmetric convex polytope generated by vectors $\pm X_1,...,\pm X_N\in\R^n$, ($N\ge n$). We introduce a class of random sampling matrices and show that they…

Probability · Mathematics 2009-05-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

A matrix $A \in \mathbb{C}^{q \times N}$ satisfies the restricted isometry property of order $k$ with constant $\varepsilon$ if it preserves the $\ell_2$ norm of all $k$-sparse vectors up to a factor of $1\pm \varepsilon$. We prove that a…

Data Structures and Algorithms · Computer Science 2015-10-14 Ishay Haviv , Oded Regev

Random matrices are widely used in sparse recovery problems, and the relevant properties of matrices with i.i.d. entries are well understood. The current paper discusses the recently introduced Restricted Eigenvalue (RE) condition, which is…

Statistics Theory · Mathematics 2011-06-07 Mark Rudelson , Shuheng Zhou

We study statistical restricted isometry, a property closely related to sparse signal recovery, of deterministic sensing matrices of size $m \times N$. A matrix is said to have a statistical restricted isometry property (StRIP) of order $k$…

Information Theory · Computer Science 2016-11-17 Alexander Barg , Arya Mazumdar , Rongrong Wang

Recently, the precise performance of the Generalized LASSO algorithm for recovering structured signals from compressed noisy measurements, obtained via i.i.d. Gaussian matrices, has been characterized. The analysis is based on a framework…

Information Theory · Computer Science 2015-03-26 Christos Thrampoulidis , Babak Hassibi

Given a real matrix A with n columns, the problem is to approximate the Gram product AA^T by c << n weighted outer products of columns of A. Necessary and sufficient conditions for the exact computation of AA^T (in exact arithmetic) from c…

Numerical Analysis · Mathematics 2014-05-16 John T. Holodnak , Ilse C. F. Ipsen

A matrix $\Phi \in \mathbb{R}^{Q \times N}$ satisfies the restricted isometry property if $\|\Phi x\|_2^2$ is approximately equal to $\|x\|_2^2$ for all $k$-sparse vectors $x$. We give a construction of RIP matrices with the optimal $Q =…

Information Theory · Computer Science 2024-12-19 Shravas Rao

In this paper, we study a general low-rank matrix recovery problem with linear measurements corrupted by some noise. The objective is to understand under what conditions on the restricted isometry property (RIP) of the problem local search…

Optimization and Control · Mathematics 2023-07-26 Ziye Ma , Yingjie Bi , Javad Lavaei , Somayeh Sojoudi

In this paper we study the robustness properties of dimensionality reduction with Gaussian random matrices having arbitrarily erased rows. We first study the robustness property against erasure for the almost norm preservation property of…

Information Theory · Computer Science 2015-01-09 Bin Han , Zhiqiang Xu

Let $A$ be an $N \times N$ Fourier matrix over $\mathbb{F}_p^{\log{N}/\log{p}}$ for some prime $p$. We improve upon known lower bounds for the number of rows of $A$ that must be sampled so that the resulting matrix $M$ satisfies the…

Information Theory · Computer Science 2019-03-29 Shravas Rao

Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy the…

Computational Complexity · Computer Science 2011-10-18 Pascal Koiran , Anastasios Zouzias

Leveraging recent advances in additive combinatorics, we exhibit explicit matrices satisfying the Restricted Isometry Property with better parameters. Namely, for $\varepsilon=3.26\cdot 10^{-7}$, large $k$ and $k^{2-\varepsilon} \le N\le…

Combinatorics · Mathematics 2023-11-01 Kevin Ford , Denka Kutzarova , George Shakan

We study random matrices with independent subgaussian columns. Assuming each column has a fixed Euclidean norm, we establish conditions under which such matrices act as near-isometries when restricted to a given subset of their domain. We…

Probability · Mathematics 2025-09-05 Yaniv Plan , Roman Vershynin

This paper investigates the behaviour of the spectrum of generally correlated Gaussian random matrices whose columns are zero-mean independent vectors but have different correlations, under the specific regime where the number of their…

Information Theory · Computer Science 2014-12-30 Abla Kammoun , M. S. Alouini

We obtain lower tail estimates for the smallest singular value of random matrices with independent but non-identically distributed entries. Specifically, we consider $n\times n$ matrices with complex entries of the form \[ M = A\circ X + B…

Probability · Mathematics 2018-05-21 Nicholas A. Cook

Compressed Sensing aims to capture attributes of $k$-sparse signals using very few measurements. In the standard Compressed Sensing paradigm, the $\m\times \n$ measurement matrix $\A$ is required to act as a near isometry on the set of all…

Information Theory · Computer Science 2015-05-14 Robert Calderbank , Stephen Howard , Sina Jafarpour

We establish the restricted isometry property for finite dimensional Gabor systems, that is, for families of time--frequency shifts of a randomly chosen window function. We show that the $s$-th order restricted isometry constant of the…

Information Theory · Computer Science 2014-04-29 Götz E. Pfander , Holger Rauhut , Joel A. Tropp

Matrices with the restricted isometry property (RIP) are of particular interest in compressed sensing. To date, the best known RIP matrices are constructed using random processes, while explicit constructions are notorious for performing at…

Functional Analysis · Mathematics 2014-03-17 Dustin G. Mixon

The bound that arises out of sparse recovery analysis in compressed sensing involves input signal sparsity and some property of the sensing matrix. An effort has therefore been made in the literature to optimize sensing matrices for optimal…

Information Theory · Computer Science 2017-07-12 Alankar Kotwal , Ajit Rajwade