Sparse Reconstruction from Hadamard Matrices: A Lower Bound

03/28/2019
by   Jarosław Błasiok, et al.
0

We give a short argument that yields a new lower bound on the number of subsampled rows from a bounded, orthonormal matrix necessary to form a matrix with the restricted isometry property. We show that for a N × N Hadamard matrix, one cannot recover all k-sparse vectors unless the number of subsampled rows is Ω(k ^2 N).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2019

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices

We give a short argument that yields a new lower bound on the number of ...
research
03/28/2019

Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices

Let A be an N × N Fourier matrix over F_p^N/p for some prime p. We impro...
research
12/06/2022

Higher Lower Bounds for Sparse Oblivious Subspace Embeddings

An oblivious subspace embedding (OSE), characterized by parameters m,n,d...
research
09/25/2019

Three Dimensional Sums of Character Gabor Systems

In deterministic compressive sensing, one constructs sampling matrices t...
research
01/14/2018

Frame Moments and Welch Bound with Erasures

The Welch Bound is a lower bound on the root mean square cross correlati...
research
09/30/2021

Colouring locally sparse graphs with the first moment method

We give a short proof of a bound on the list chromatic number of graphs ...
research
04/20/2018

On the Post Selection Inference constant under Restricted Isometry Properties

Uniformly valid confidence intervals post model selection in regression ...

Please sign up or login with your details

Forgot password? Click here to reset