Simple norm bounds for polynomial random matrices via decoupling
From MaRDI portal
Cites work
- A nearly tight sum-of-squares lower bound for the planted clique problem
- An introduction to matrix concentration inequalities
- Compressive sensing and structured random matrices
- Concentration and moment inequalities for polynomials of independent random variables
- Concentration inequalities for non-Lipschitz functions with bounded derivatives of higher order
- Concentration of multivariate polynomials and its applications
- Concentration of polynomial random matrices via Efron-Stein inequalities
- Decoupling inequalities for polynomial chaos
- Efron-Stein inequalities for random matrices
- Estimates of moments and tails of Gaussian chaoses
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- High-dimensional probability. An introduction with applications in data science
- Higher order concentration of measure
- Learning mixtures of Gaussians in high dimensions
- Matrix concentration inequalities via the method of exchangeable pairs
- Matrix Poincaré inequalities and concentration
- Nonlinear matrix concentration via semigroup methods
- Polynomial bounds for decoupling, with applications
- Polynomial-time power-sum decomposition of polynomials
- Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank
- Spectral methods from tensor networks
- TRACE INEQUALITIES FOR MATRICES
This page was built for publication: Simple norm bounds for polynomial random matrices via decoupling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7296739)
