A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets
From MaRDI portal
Publication:5278301
DOI10.1007/978-3-319-45282-1_18zbMath1366.60011arXiv1603.00897OpenAlexW2288884963MaRDI QIDQ5278301
Abbas Mehrabian, Christopher Liaw, R. V. Vershinin, Yaniv Plan
Publication date: 13 July 2017
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.00897
Related Items
\(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?, Sampling rates for \(\ell^1\)-synthesis, \( \varepsilon \)-isometric dimension reduction for incompressible subsets of \(\ell_p\), Dimension-free bounds for sums of independent matrices and simple tensors via the variational principle, Matrix deviation inequality for ℓp-norm, Dimension-free bounds for sums of dependent matrices and operators with heavy-tailed distributions, Structure from Randomness in Halfspace Learning with the Zero-One Loss, An Introduction to Compressed Sensing, Sparse recovery from extreme eigenvalues deviation inequalities, Smoothed analysis for the condition number of structured real polynomial systems
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- How close is the sample covariance matrix to the actual covariance matrix?
- Hanson-Wright inequality and sub-Gaussian concentration
- Two observations regarding embedding subsets of Euclidean spaces in normed spaces
- The convex geometry of linear inverse problems
- Reconstruction and subgaussian operators in asymptotic geometric analysis
- Tail bounds via generic chaining
- Empirical processes and random projections
- Estimation in High Dimensions: A Geometric Perspective
- The Generalized Lasso With Non-Linear Observations
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Extensions of Lipschitz mappings into a Hilbert space
- Subspaces of Small Codimension of Finite-Dimensional Banach Spaces
- High-dimensional estimation with geometric constraints: Table 1.
- The Generic Chaining
- Living on the edge: phase transitions in convex programs with random data
- Asymptotic Geometric Analysis, Part I
