A Rice method proof of the null-space property over the Grassmannian
From MaRDI portal
Publication:1700392
DOI10.1214/16-AIHP772MaRDI QIDQ1700392
Jean-Marc Azaïs, Stéphane Mourareau, Yohann de Castro
Publication date: 5 March 2018
Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6417
high-dimensional statistics\(\ell_{1}\)-minimizationRice methodnull-space propertyrandom processes theory
Estimation in multivariate analysis (62H12) Linear regression; mixed models (62J05) Measures of association (correlation, canonical correlation, etc.) (62H20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Sharp recovery bounds for convex demixing, with applications
- Sparse recovery under weak moment assumptions
- Random projections of regular simplices
- On the expected condition number of linear programming problems
- On the distribution of the maximum of a Gaussian field with \(d\) parameters
- On the Lambert \(w\) function
- A remark on the Lasso and the Dantzig selector
- On the conditions used to prove oracle results for the Lasso
- Simultaneous analysis of Lasso and Dantzig selector
- Complexity of random smooth functions on the high-dimensional sphere
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Compressed sensing and best 𝑘-term approximation
- The Integral of a Symmetric Unimodal Function over a Symmetric Convex Set and Some Probability Inequalities
- On sparse reconstruction from Fourier and Gaussian measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Level Sets and Extrema of Random Processes and Fields
- Atomic Decomposition by Basis Pursuit
- Living on the edge: phase transitions in convex programs with random data
- Accuracy Guarantees for <formula formulatype="inline"> <tex Notation="TeX">$\ell_1$</tex></formula>-Recovery
- Precise Stability Phase Transitions for $\ell_1$ Minimization: A Unified Geometric Framework
- Neighborliness of randomly projected simplices in high dimensions
- Compressed sensing
