LSV-based tail inequalities for sums of random matrices
From MaRDI portal
Publication:5380642
DOI10.1162/NECO_A_00901zbMATH Open1478.15052WikidataQ45949791 ScholiaQ45949791MaRDI QIDQ5380642FDOQ5380642
Authors: Chao Zhang, Lei Du, Dacheng Tao 
Publication date: 6 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Recommendations
- User-friendly tail bounds for sums of random matrices
- Tail inequalities for sums of random matrices that depend on the intrinsic dimension
- Convenient tail bounds for sums of random tensors
- Matrix concentration inequalities via the method of exchangeable pairs
- An introduction to matrix concentration inequalities
Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Random matrices (probabilistic aspects) (60B20) Miscellaneous inequalities involving matrices (15A45)
Cites Work
- Functions of Matrices
- Inequalities: theory of majorization and its applications
- User-friendly tail bounds for sums of random matrices
- Partial differential equations with Robin boundary condition in online social networks
- Spatial Ecology via Reaction‐Diffusion Equations
- Matrix concentration inequalities via the method of exchangeable pairs
- Nonlinear eigenproblems in data analysis: balanced graph cuts and the RatioDCA-Prox
- Strong converse for identification via quantum channels
- Tail inequalities for sums of random matrices that depend on the intrinsic dimension
Cited In (4)
Uses Software
This page was built for publication: LSV-based tail inequalities for sums of random matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380642)
