skip to content

Large Graph Limits of Learning Algorithms

Presented by: 
Andrew Stuart
Tuesday 10th April 2018 - 13:30 to 14:30
INI Seminar Room 1
Many problems in machine learning require the classification of high dimensional data. One methodology to approach such problems is to construct a graph whose vertices are identified with data points, with edges weighted according to some measure of affinity between the data points. Algorithms such as spectral clustering, probit classification and the Bayesian level set method can all be applied in this setting. The goal of the talk is to describe these algorithms for classification, and analyze them in the limit of large data sets. Doing so leads to interesting problems in the calculus of variations, Bayesian inverse problems and in Monte Carlo Markov Chain, all of which will be highlighted in the talk. These limiting problems give insight into the structure of the classification problem, and algorithms for it.    

Collaboration with:  
Andrea Bertozzi (UCLA)
Michael Luo (UCLA)
Kostas Zygalakis (Edinburgh)  
Matt Dunlop (Caltech)
Dejan Slepcev (CMU)
Matt Thorpe (Cambridge)
(forthcoming paper)
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons