English
Related papers

Related papers: Explicit RIP matrices: an update

200 papers

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 Constants (RIC) of a matrix $A$ measures how close to an isometry is the action of $A$ on vectors with few nonzero entries, measured in the $\ell^2$ norm. Specifically, the upper and lower RIC of a matrix $A$ of size…

Information Theory · Computer Science 2010-03-22 Bubacarr Bah , Jared Tanner

Recently, many works have focused on the characterization of non-linear dimensionality reduction methods obtained by quantizing linear embeddings, e.g., to reach fast processing time, efficient data compression procedures, novel…

Information Theory · Computer Science 2016-12-30 Laurent Jacques , Valerio Cambareri

In this paper, we prove that the Paley graph conjecture implies that the Paley matrix has restricted isometry property (RIP) beating the square-root bottleneck for the sparsity level. Moreover, we show that the RIP of the Paley matrix…

Combinatorics · Mathematics 2020-11-09 Shohei Satake

In the present note, we study a new method of constructing efficient coverings for Kronecker powers of matrices, recently proposed by J. Alman, Y. Guan, A. Padaki [arXiv, 2022]. We provide an alternative proof for the case of symmetric…

Data Structures and Algorithms · Computer Science 2022-12-06 Igor S. Sergeev

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

In this paper, we introduce the notion of (strictly) semimonotone matrices of exact order $k$, where $0\leq k\leq n$, and explore their properties. We fully characterize the $3 \times 3$ (strictly) semimonotone matrices of exact order $2$,…

Optimization and Control · Mathematics 2026-03-03 Bharat Pratap Chauhan , Dipti Dubey

In this work, we generalize the probability simplex constraint to matrices, i.e., $\mathbf{X}_1 + \mathbf{X}_2 + \ldots + \mathbf{X}_K = \mathbf{I}$, where $\mathbf{X}_i \succeq 0$ is a symmetric positive semidefinite matrix of size…

Optimization and Control · Mathematics 2020-11-18 Bamdev Mishra , Hiroyuki Kasai , Pratik Jawanpuria

For a two-parameter family of lower triangular matrices with entries involving Jacobi polynomials an explicit inverse is given, with entries involving a sum of two Jacobi polynomials. The formula simplifies in the Gegenbauer case and then…

Classical Analysis and ODEs · Mathematics 2015-03-25 Leandro Cagliero , Tom H. Koornwinder

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

A random construction of bipolar sensing matrices based on binary linear codes is introduced and its RIP (Restricted Isometry Property) is analyzed based on an argument on the ensemble average of the weight distribution of binary linear…

Information Theory · Computer Science 2016-11-15 Tadashi Wadayama

We improve the estimates in the restriction problem in dimension $n \ge 4$. To do so, we establish a weak version of a $k$-linear restriction estimate for any $k$. The exponents in this weak $k$-linear estimate are sharp for all $k$ and…

Classical Analysis and ODEs · Mathematics 2017-11-06 Larry Guth

Structures play a significant role in the field of signal processing. As a representative of structural data, low rank matrix along with its restricted isometry property (RIP) has been an important research topic in compressive signal…

Information Theory · Computer Science 2015-06-23 Xinyue Shen , Yuantao Gu

The columnwise Khatri-Rao product of two matrices is an important matrix type, reprising its role as a structured sensing matrix in many fundamental linear inverse problems. Robust signal recovery in such inverse problems is often…

Information Theory · Computer Science 2018-07-25 Saurabh Khanna , Chandra R Murthy

We propose an information-theoretic framework for matrix completion. The theory goes beyond the low-rank structure and applies to general matrices of "low description complexity". Specifically, we consider $m\times n$ random matrices…

Information Theory · Computer Science 2016-08-11 Erwin Riegler , David Stotz , Helmut Bölcskei

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

We study the restricted isometry property of a matrix that is built from the discrete Fourier transform matrix by collecting rows indexed by quadratic residues. We find an $\epsilon>0$ such that, conditioned on a folklore conjecture in…

Functional Analysis · Mathematics 2014-10-24 Afonso S. Bandeira , Dustin G. Mixon , Joel Moreira

This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Jeffrey C. Lagarias

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

The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar…

Computational Complexity · Computer Science 2015-01-27 Abhinav Kumar , Satyanarayana V. Lokam , Vijay M. Patankar , Jayalal Sarma M. N