Suprema of chaos processes and the restricted isometry property

DOI10.1002/CPA.21504zbMATH Open1310.94024OpenAlexW2117790027MaRDI QIDQ2929397FDOQ2929397

Authors Felix Krahmer, Shahar Mendelson, Holger Rauhut

Publication date 12 November 2014

Published in Communications on Pure and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.0235

Mathematics Subject Classification ID

Gaussian processes (60G15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (probabilistic aspects) (60B20)

Abstract: We present a new bound for suprema of a special type of chaos processes indexed by a set of matrices, which is based on a chaining method. As applications we show significantly improved estimates for the restricted isometry constants of partial random circulant matrices and time-frequency structured random matrices. In both cases the required condition on the number $m$ of rows in terms of the sparsity $s$ and the vector length $n$ is $mgtrsimslo{g}^{2}slo{g}^{2}n$.

Recommendations

• Improved bounds for the RIP of subsampled circulant matrices
• The restricted isometry property for time-frequency structured random matrices
• A simple proof of the restricted isometry property for random matrices
• Restricted isometries for partial random circulant matrices
• An Improved Estimate in the Restricted Isometry Problem

Cites work

• scientific article; zbMATH DE number 49190 (Why is no real title available?)
• A simple proof of the restricted isometry property for random matrices
• A variant of the Johnson-Lindenstrauss lemma for circulant matrices
• Atomic Decomposition by Basis Pursuit
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Compressed sensing
• Compressive sensing
• Compressive sensing by random convolution
• Concentration inequalities using the entropy method
• Hard thresholding pursuit: an algorithm for compressive sensing
• High-Resolution Radar via Compressed Sensing
• Identification of Matrices Having a Sparse Representation
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
• Invertibility of ``large submatrices with applications to the geometry of Banach spaces and harmonic analysis
• Iterative hard thresholding for compressed sensing
• Johnson-Lindenstrauss lemma for circulant matrices
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• New concentration inequalities in product spaces
• Non commutative Khintchine and Paley inequalities
• On decoupling, series expansions, and tail behavior of chaos processes
• On sparse reconstruction from Fourier and Gaussian measurements
• Random vectors in the isotropic position
• Reconstruction and subgaussian operators in asymptotic geometric analysis
• Regularity of Gaussian processes
• Restricted isometries for partial random circulant matrices
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• Sparsity in time-frequency representations
• Stable signal recovery from incomplete and inaccurate measurements
• The Generic Chaining
• The restricted isometry property for time-frequency structured random matrices
• The sizes of compact subsets of Hilbert space and continuity of Gaussian processes
• Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
• Uncertainty in time-frequency representations on finite Abelian groups and applications
• Uniform Central Limit Theorems

Cited in

(55)

• Some notes on concentration for \(\alpha\)-subexponential random variables
• Forty years of frequent items
• Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery
• Fast Metric Embedding into the Hamming Cube
• Sampling of operators
• A novel compressed sensing scheme for photoacoustic tomography
• Robust width: a characterization of uniformly stable and robust compressed sensing
• The restricted isometry property for random block diagonal matrices
• Optimal fast Johnson-Lindenstrauss embeddings for large data sets
• Robust recovery of low-rank matrices with non-orthogonal sparse decomposition from incomplete measurements
• Uniform Hanson-Wright type concentration inequalities for unbounded entries via the entropy method
• Fast and RIP-optimal transforms
• Compressive sensing with redundant dictionaries and structured measurements
• Quantization and compressive sensing
• Quantized compressed sensing for random circulant matrices
• Noncommutative Bennett and Rosenthal inequalities
• Tensor Regression Using Low-Rank and Sparse Tucker Decompositions
• Book Review: A mathematical introduction to compressive sensing
• Compressed dictionary learning
• Cosparsity in Compressed Sensing
• Cornerstones of sampling of operator theory
• Sparsity and incoherence in orthogonal matching pursuit
• Proof methods for robust low-rank matrix recovery
• Hanson-Wright inequality in Banach spaces
• Sparse model uncertainties in compressed sensing with application to convolutions and sporadic communication
• On the geometry of polytopes generated by heavy-tailed random vectors
• Derandomized compressed sensing with nonuniform guarantees for \(\ell_1\) recovery
• The restricted isometry property of block diagonal matrices for group-sparse signal recovery
• The restricted isometry property for time-frequency structured random matrices
• Spectral Methods for Passive Imaging: Nonasymptotic Performance and Robustness
• Non-Cartesian spiral binary sensing matrices
• scientific article; zbMATH DE number 7370563 (Why is no real title available?)
• Discrete uncertainty principles and sparse signal processing
• Improved bounds for sparse recovery from subsampled random convolutions
• Low rank tensor recovery via iterative hard thresholding
• Optimal injectivity conditions for bilinear inverse problems with applications to identifiability of deconvolution problems
• Super-resolution radar
• Short-term memory capacity in networks via the restricted isometry property
• Improved bounds for the RIP of subsampled circulant matrices
• Compressive time-of-flight 3D imaging using block-structured sensing matrices
• Robust Phase Retrieval Algorithm for Time-Frequency Structured Measurements
• Uniform recovery from subgaussian multi-sensor measurements
• Conjugate gradient acceleration of iteratively re-weighted least squares methods
• On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
• Deterministic convolutional compressed sensing matrices
• Uniform recovery of fusion frame structured sparse signals
• Endpoint results for Fourier integral operators on noncompact symmetric spaces
• An introduction to compressed sensing
• Real-valued embeddings and sketches for fast distance and similarity estimation
• Quantization of compressive samples with stable and robust recovery
• Derandomizing restricted isometries via the Legendre symbol
• Interpolation via weighted \(\ell_{1}\) minimization
• Refined analysis of sparse MIMO radar
• Near-optimal mean estimators with respect to general norms
• Quantized compressed sensing: a survey

Describes a project that uses

Uses Software

• CoSaMP

This page was built for publication: Suprema of chaos processes and the restricted isometry property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929397)