Quicklists
Javascript must be enabled

Peter Diao : Model-Free Consistency of Graph Partitioning using Dense Graph Limits

The beautiful work of Borgs, Chayes, Lovasz, Sos, Szegedy, Vesztergombi, and many others on dense graph limits has received quite a bit of attention in pure math as well as statistics and machine learning. In this talk we will review some of the previous work on dense graph limits and then present recent work on providing a more robust mathematical framework for proving the statistical consistency of graph partitioning algorithms such as spectral clustering. A striking feature of our approach is that it is model-free, compared to the popular iid paradigm. Our results are thus broadly applicable in real-world settings, where it is notoriously difficult to obtain relevant models for network data, and observations are not independent. At the end, I will discuss implications for how mathematical foundations can be developed for other modern data analysis techniques. This is joint work with Dominique Guillot, Apoorva Khare, and Bala Rajaratnam. Preprint available at https://arxiv.org/abs/1608.03860.

Add to Favorites

Please select playlist name from following

Create new playlist

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.

0 Comments

Comments Disabled For This Video