This version of Talks.cam will be replaced by 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Peter Whittle Lecture > The role of Random Matrix Theory for the optimization algorithms of Machine Learning

The role of Random Matrix Theory for the optimization algorithms of Machine Learning

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

If you have a question about this talk, please contact Richard Samworth.

I will survey recent progress in the understanding of the optimization dynamics for important tasks for Machine Learning or high dimensional statistics. We will see how these very high-dimensional dynamics are in fact ruled by the so-called “effective dynamics” of much lower dimensional systems. This dynamical dimension reduction is related to the BBP spectral transition of Random Matrix Theory, appearing dynamically along the algorithm path. I will illustrate these phenomena in multi-spike Tensor PCA , XOR, and classification of Gaussian mixtures with multi-layer neural nets.

This talk is based on joint works with Reza Gheissari (Northwestern), Jiaoyang Huang (Wharton), Aukosh Jagannath (Waterloo), and on joint works with Cedric Gerbelot (ENS Lyon) and Vanessa Piccolo (EPFL).

A wine reception in the Central Core will follow the lecture.

This talk is part of the Peter Whittle Lecture series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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