pith. sign in

arxiv: 1308.2952 · v1 · pith:LKW5SHVBnew · submitted 2013-08-13 · 💻 cs.IT · math.IT· math.PR

Subadditivity of Matrix phi-Entropy and Concentration of Random Matrices

classification 💻 cs.IT math.ITmath.PR
keywords matrixconcentrationinequalitiesmethodrandomappliesargumentsbound
0
0 comments X
read the original abstract

Matrix concentration inequalities provide a direct way to bound the typical spectral norm of a random matrix. The methods for establishing these results often parallel classical arguments, such as the Laplace transform method. This work develops a matrix extension of the entropy method, and it applies these ideas to obtain some matrix concentration inequalities.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.