|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 listsInference Group Peter Whittle Colloquium The Cambridge Group for the History of Population and Social Structure - seminar series
Other talksFrom ‘Protectors of Public Health’ to ‘Facilitators of Biomedical Innovation’: Drivers and Impacts of Trends in Pharmaceutical Regulation in the United States and European Union since 1992 The competitive benefits of forward contracting over space and time (with Frank Wolak) Who’s Afraid of Fractional Order Laplace? TBA Photographing Plants Production Processes Group Seminar