English
Related papers

Related papers: $\ell_p$-Spread and Restricted Isometry Properties…

200 papers

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

We formulate a generalization of the Restricted Isometry Property (RIP) referred to as the Restricted Quasiconvexity Isometry Property (RQIP) for alpha stable random projections with $0<\alpha<1$. A lower bound on the number of rows for…

Probability · Mathematics 2025-07-04 Sunder Ram Krishnan

We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random. These matrices have a one-to-one correspondence with the adjacency…

Information Theory · Computer Science 2013-07-25 Bubacarr Bah , Jared Tanner

Matrices satisfying the Restricted Isometry Property (RIP) play an important role in the areas of compressed sensing and statistical learning. RIP matrices with optimal parameters are mainly obtained via probabilistic arguments, as explicit…

Machine Learning · Computer Science 2019-11-01 Shiva Prasad Kasiviswanathan , Mark Rudelson

This paper studies sparse elliptic random matrix models which generalize both the classical elliptic ensembles and sparse i.i.d. matrix models by incorporating correlated entries and a tunable sparsity parameter $p_n$. Each $n\times n$…

Probability · Mathematics 2025-08-08 Jackson Carpenter , Sean O'Rourke

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

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Data Structures and Algorithms · Computer Science 2014-03-19 David P. Woodruff , Qin Zhang

Randomized smoothing, using just a simple isotropic Gaussian distribution, has been shown to produce good robustness guarantees against $\ell_2$-norm bounded adversaries. In this work, we show that extending the smoothing technique to…

Machine Learning · Computer Science 2020-08-17 Aounon Kumar , Alexander Levine , Tom Goldstein , Soheil Feizi

We give near-tight lower bounds for the sparsity required in several dimensionality reducing linear maps. First, consider the JL lemma which states that for any set of n vectors in R there is a matrix A in R^{m x d} with m = O(eps^{-2}log…

Data Structures and Algorithms · Computer Science 2012-11-07 Jelani Nelson , Huy L. Nguyen

We study the level spacing distribution $P(S)$ of 2D real random matrices both symmetric as well as general, non-symmetric. In the general case we restrict ourselves to Gaussian distributed matrix elements, but different widths of the…

Chaotic Dynamics · Physics 2015-05-13 S. Grossmann , M. Robnik

We present a detailed analysis of the unconstrained $\ell_1$-weighted LASSO method for recovery of sparse data from its observation by randomly generated matrices, satisfying the Restricted Isometry Property (RIP) with constant $\delta<1$,…

Information Theory · Computer Science 2022-03-16 Simon Foucart , Eitan Tadmor , Ming Zhong

Under suitable hypotheses, we construct a probability measure on the set of closed maximal isotropic subspaces of a locally compact quadratic space over F_p. A random subspace chosen with respect to this measure is discrete with probability…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen , Eric Rains

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

Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…

Data Structures and Algorithms · Computer Science 2021-08-09 Yi Li , David P. Woodruff , Taisuke Yasuda

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

Are two sets of observations drawn from the same distribution? This problem is a two-sample test. Kernel methods lead to many appealing properties. Indeed state-of-the-art approaches use the $L^2$ distance between kernel-based distribution…

Machine Learning · Statistics 2019-10-02 M. Scetbon , G. Varoquaux

We consider the ensemble of N-dimensional random symmetric matrices A that have, in average, p non-zero elements per row. We study the asymptotic behavior of the norm of A in the limit of infinitely increasing N and p. We prove that the…

Probability · Mathematics 2014-11-18 A. Khorunzhy

In the Compressed Sensing community, it is well known that given a matrix $X \in \mathbb R^{n\times p}$ with $\ell_2$ normalized columns, the Restricted Isometry Property (RIP) implies the Null Space Property (NSP). It is also well known…

Statistics Theory · Mathematics 2016-06-30 Stéphane Chrétien , Zhen Wai Olivier Ho

Sparse random projection (RP) is a popular tool for dimensionality reduction that shows promising performance with low computational complexity. However, in the existing sparse RP matrices, the positions of non-zero entries are usually…

Machine Learning · Computer Science 2020-02-10 Li Chen , Shuizheng Zhou , Jiajun Ma

Motivated by the problem of compressing point sets into as few bits as possible while maintaining information about approximate distances between points, we construct random nonlinear maps $\varphi_\ell$ that compress point sets in the…

Computational Geometry · Computer Science 2024-03-05 Brett Leroux , Luis Rademacher