|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Matrix Concentration Inequalities via the Method of Exchangeable Pairs
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.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsAll CMS Events Graham Storey Lecture Type the title of a new list here
Other talksCreation, Collaboration, Contemplation: Academic Libraries and the Digital Revolution Deep consequences: Why syntax (as we know it) isn't a thing, and other (shocking?) conclusions from modelling language with neural nets. “The AML Genome(s): Mutations in Four Dimensions” Better the bug you know? – Basic bioscience underpinning infection control The 2015 Annual Risk Summit Judaeo-Masonic-Bolshevik Conspiracy in Spain 1931-36