|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 listsComputer Laboratory Opera Group Seminars Cambridge International Forum for Development Workshop "Formalism and Functionalism in Negation"
Other talksIndecent science: religion, science and movie censorship, 1930–1968 Re-building the diseased retina with stem cells Active and Passive Immunization against Infectious Disease TBC The Great War and the British Problem, 1914-2014 Under pressure: Environmental stressors alter relationships between physiology and behaviour in fishes