University of Cambridge > Talks.cam > Machine Learning @ CUED > Matrix Concentration Inequalities via the Method of Exchangeable Pairs

Matrix Concentration Inequalities via the Method of Exchangeable Pairs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Zoubin Ghahramani.

I will present an approach to deriving exponential concentration inequalities and polynomial moment inequalities for the spectral norm of a random matrix based on Stein’s method of exchangeable pairs. Our work extends results by Chatterjee on concentration for scalar random variables to the setting of random matrices. When applied to a sum of independent random matrices, this approach yields matrix generalizations of the classical inequalities due to Hoeffding, Bernstein, Khintchine, and Rosenthal. The same technique delivers bounds for sums of dependent random matrices and more general matrix-valued functions of dependent random variables.

This talk is part of the Machine Learning @ CUED series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2014 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity