Optimal and algorithmic norm regularization of random matrices

DOI10.1090/proc/15964zbMath1500.15032arXiv2012.00175OpenAlexW4225641497MaRDI QIDQ5096658

Vishesh Jain, Mehtaab Sawhney, Ashwin Sah

Publication date: 18 August 2022

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

zbMATH Keywords

normalgorithmrandom matrix

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Random matrices (algebraic aspects) (15B52)

Cites Work

• Unnamed Item
• Constructive regularization of the random matrix norm
• On the limit of the largest eigenvalue of the large dimensional sample covariance matrix
• A note on the largest eigenvalue of a large dimensional sample covariance matrix
• Norms of random matrices: local and global problems
• Non-asymptotic theory of random matrices: extreme singular values
• The Expected Norm of Random Matrices
• Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
• Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization
• Spectral techniques applied to sparse random graphs
• Probability Inequalities for Sums of Bounded Random Variables
• Concentration and regularization of random graphs

This page was built for publication: Optimal and algorithmic norm regularization of random matrices