English
Related papers

Related papers: The Average-Case Time Complexity of Certifying the…

200 papers

The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for…

Machine Learning · Computer Science 2016-06-01 Tengyao Wang , Quentin Berthet , Yaniv Plan

Given a matrix $A$ with $n$ rows, a number $k<n$, and $0<\delta < 1$, $A$ is $(k,\delta)$-RIP (Restricted Isometry Property) if, for any vector $x \in \mathbb{R}^n$, with at most $k$ non-zero co-ordinates, $$(1-\delta) \|x\|_2 \leq \|A…

Computational Complexity · Computer Science 2014-06-24 Abhiram Natarajan , Yi Wu

A matrix is said to possess the Restricted Isometry Property (RIP) if it acts as an approximate isometry when restricted to sparse vectors. Previous work has shown it to be NP-hard to determine whether a matrix possess this property, but…

Computational Complexity · Computer Science 2018-07-04 Jonathan Weed

This paper is concerned with an important matrix condition in compressed sensing known as the restricted isometry property (RIP). We demonstrate that testing whether a matrix satisfies RIP is NP-hard. As a consequence of our result, it is…

Functional Analysis · Mathematics 2017-10-03 Afonso S. Bandeira , Edgar Dobriban , Dustin G. Mixon , William F. Sawin

The most frequently used condition for sampling matrices employed in compressive sampling is the restricted isometry (RIP) property of the matrix when restricted to sparse signals. At the same time, imposing this condition makes it…

Information Theory · Computer Science 2013-03-11 Alexander Barg , Arya Mazumdar , Rongrong Wang

In Compressive Sensing, the Restricted Isometry Property (RIP) ensures that robust recovery of sparse vectors is possible from noisy, undersampled measurements via computationally tractable algorithms. It is by now well-known that Gaussian…

Information Theory · Computer Science 2014-02-17 Armin Eftekhari , Han Lun Yap , Christopher J. Rozell , Michael B. Wakin

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

A matrix $A$ is said to have the $\ell_p$-Restricted Isometry Property ($\ell_p$-RIP) if for all vectors $x$ of up to some sparsity $k$, $\|{Ax}\|_p$ is roughly proportional to $\|{x}\|_p$. We study this property for $m \times n$ matrices…

Computational Complexity · Computer Science 2023-05-09 Venkatesan Guruswami , Peter Manohar , Jonathan Mosheiff

The Restricted Isometry Property (RIP) is a fundamental property of a matrix which enables sparse recovery. Informally, an $m \times n$ matrix satisfies RIP of order $k$ for the $\ell_p$ norm, if $\|Ax\|_p \approx \|x\|_p$ for every vector…

Data Structures and Algorithms · Computer Science 2015-02-24 Zeyuan Allen-Zhu , Rati Gelashvili , Ilya Razenshteyn

This paper deals with the computational complexity of conditions which guarantee that the NP-hard problem of finding the sparsest solution to an underdetermined linear system can be solved by efficient algorithms. In the literature, several…

Optimization and Control · Mathematics 2013-11-05 Andreas M. Tillmann , Marc E. Pfetsch

The Restricted Isometry Property (RIP) is a fundamental property of a matrix enabling sparse recovery. Informally, an m x n matrix satisfies RIP of order k in the l_p norm if ||Ax||_p \approx ||x||_p for any vector x that is k-sparse, i.e.,…

Data Structures and Algorithms · Computer Science 2014-04-29 Piotr Indyk , Ilya Razenshteyn

The restricted isometry property (RIP) is essential for the linear map to guarantee the successful recovery of low-rank matrices. The existing works show that the linear map generated by the measurement matrices with independent and…

Information Theory · Computer Science 2024-05-08 Wei Zhang , Zhenni Wang

Restricted isometry property (RIP), essentially stating that the linear measurements are approximately norm-preserving, plays a crucial role in studying low-rank matrix recovery problem. However, RIP fails in the robust setting, when a…

Machine Learning · Computer Science 2021-09-29 Jianhao Ma , Salar Fattahi

The many variants of the restricted isometry property (RIP) have proven to be crucial theoretical tools in the fields of compressed sensing and matrix completion. The study of extending compressed sensing to accommodate phaseless…

Information Theory · Computer Science 2014-04-16 Vladislav Voroninski , Zhiqiang Xu

The restricted isometry property (RIP) is a well-known matrix condition that provides state-of-the-art reconstruction guarantees for compressed sensing. While random matrices are known to satisfy this property with high probability,…

Functional Analysis · Mathematics 2012-02-24 Afonso S. Bandeira , Matthew Fickus , Dustin G. Mixon , Percy Wong

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

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

The study of the restricted isometry property (RIP) of corrupted random matrices is particularly important in the field of compressed sensing (CS) with corruptions. If a matrix still satisfies the RIP after that a certain portion of rows…

Probability · Mathematics 2019-03-22 Ran Lu

In compressed sensing, the "restricted isometry property" (RIP) is a sufficient condition for the efficient reconstruction of a nearly k-sparse vector x in C^d from m linear measurements Phi x. It is desirable for m to be small, and for Phi…

Data Structures and Algorithms · Computer Science 2012-11-07 Jelani Nelson , Eric Price , Mary Wootters

Compressed Sensing (CS) seeks to recover an unknown vector with $N$ entries by making far fewer than $N$ measurements; it posits that the number of compressed sensing measurements should be comparable to the information content of the…

Information Theory · Computer Science 2010-04-29 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner
‹ Prev 1 2 3 10 Next ›