English
Related papers

Related papers: Explicit Matrices with the Restricted Isometry Pro…

200 papers

It is natural to ask: what kinds of matrices satisfy the Restricted Eigenvalue (RE) condition? In this paper, we associate the RE condition (Bickel-Ritov-Tsybakov 09) with the complexity of a subset of the sphere in $\R^p$, where $p$ is the…

Statistics Theory · Mathematics 2009-12-27 Shuheng Zhou

In this paper, we provide a new approach to estimating the error of reconstruction from $\Sigma\Delta$ quantized compressed sensing measurements. Our method is based on the restricted isometry property (RIP) of a certain projection of the…

Information Theory · Computer Science 2015-06-19 Joe-Mei Feng , Felix Krahmer

Restricted Isometry Constants (RICs) provide a measure of how far from an isometry a matrix can be when acting on sparse vectors. This, and related quantities, provide a mechanism by which standard eigen-analysis can be applied to topics…

Numerical Analysis · Mathematics 2013-07-16 Bubacarr Bah , Jared Tanner

In this work, we develop a new complexity metric for an important class of low-rank matrix optimization problems in both symmetric and asymmetric cases, where the metric aims to quantify the complexity of the nonconvex optimization…

Optimization and Control · Mathematics 2023-07-24 Haixiang Zhang , Baturalp Yalcin , Javad Lavaei , Somayeh Sojoudi

We will show that tight frames satisfying the restricted isometry property give rise to nearly tight fusion frames which are nearly orthogonal and hence are nearly equi-isoclinic. We will also show how to replace parts of the RIP frame with…

Functional Analysis · Mathematics 2011-12-02 Bernhard Bodmann , Jameson Cahill , Peter G. Casazza

The restricted isometry property (RIP) is a universal tool for data recovery. We explore the implication of the RIP in the framework of generalized sparsity and group measurements introduced in the Part I paper. It turns out that for a…

Machine Learning · Statistics 2017-07-03 Marius Junge , Kiryung Lee

A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many…

Information Theory · Computer Science 2010-04-13 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner , Andrew Thompson

The angle between two compressed sparse vectors subject to the norm/distance constraints imposed by the restricted isometry property (RIP) of the sensing matrix plays a crucial role in the studies of many compressive sensing (CS) problems.…

Information Theory · Computer Science 2016-11-18 Ling-Hua Chang , Jwo-Yuh Wu

This paper deals with the problem of robust matrix completion -- retrieving a low-rank matrix and a sparse matrix from the compressed counterpart of their superposition. Though seemingly not an unresolved issue, we point out that the…

Information Theory · Computer Science 2024-10-10 Yinjian Wang

Let $A$ be a matrix whose columns $X_1,\dots, X_N$ are independent random vectors in $\mathbb{R}^n$. Assume that the tails of the 1-dimensional marginals decay as $\mathbb{P}(|\langle X_i, a\rangle|\geq t)\leq t^{-p}$ uniformly in $a\in…

Probability · Mathematics 2015-09-09 Olivier Guédon , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

Consider the problem of recovering an unknown signal from undersampled measurements, given the knowledge that the signal has a sparse representation in a specified dictionary $D$. This problem is now understood to be well-posed and…

Information Theory · Computer Science 2015-06-09 Felix Krahmer , Deanna Needell , Rachel Ward

Hierarchically sparse signals and Kronecker product structured measurements arise naturally in a variety of applications. The simplest example of a hierarchical sparsity structure is two-level $(s,\sigma)$-hierarchical sparsity which…

Information Theory · Computer Science 2018-02-01 I. Roth , A. Flinth , R. Kueng , J. Eisert , G. Wunder

Several exact recovery criteria (ERC) ensuring that orthogonal matching pursuit (OMP) identifies the correct support of sparse signals have been developed in the last few years. These ERC rely on the restricted isometry property (RIP), the…

Information Theory · Computer Science 2015-12-16 Jean-François Determe , Jérôme Louveaux , Laurent Jacques , François Horlin

In the context of sketching for compressive mixture modeling, we revisit existing proofs of the Restricted Isometry Property of sketching operators with respect to certain mixtures models. After examining the shortcomings of existing…

Machine Learning · Statistics 2024-06-14 Ayoub Belhadji , Rémi Gribonval

In previous work, theoretical analysis based on the tensor Restricted Isometry Property (t-RIP) established the robust recovery guarantees of a low-tubal-rank tensor. The obtained sufficient conditions depend strongly on the assumption that…

Machine Learning · Statistics 2019-09-17 Feng Zhang , Wendong Wang , Jingyao Hou , Jianjun Wang , Jianwen Huang

Compressed sensing (CS) theory considers the restricted isometry property (RIP) as a sufficient condition for measurement matrix which guarantees the recovery of any sparse signal from its compressed measurements. The RIP condition also…

Other Computer Science · Computer Science 2013-09-24 Seyed Hossein Hosseini , Mahrokh G. Shayesteh , Mehdi Chehel Amirani

Dimension reduction plays an essential role when decreasing the complexity of solving large-scale problems. The well-known Johnson-Lindenstrauss (JL) Lemma and Restricted Isometry Property (RIP) admit the use of random projection to reduce…

Information Theory · Computer Science 2018-03-14 Gen Li , Yuantao Gu

When the linear measurements of an instance of low-rank matrix recovery satisfy a restricted isometry property (RIP)---i.e. they are approximately norm-preserving---the problem is known to contain no spurious local minima, so exact recovery…

Machine Learning · Computer Science 2018-11-01 Richard Y. Zhang , Cédric Josz , Somayeh Sojoudi , Javad Lavaei

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…

Information Theory · Computer Science 2009-10-18 Robert Calderbank , Stephen Howard , Sina Jafarpour

In this work we establish the Restricted Isometry Property (RIP) of the centered column-wise self Khatri-Rao (KR) products of $n\times N$ matrix with iid columns drawn either uniformly from a sphere or with iid sub-Gaussian entries. The…

Information Theory · Computer Science 2019-05-23 Alexander Fengler , Peter Jung