# Dejan Slepcev : Variational problems on graphs and their continuum limit

I will discuss variational problems arising in machine learning and their limits as the number of data points goes to infinity. Consider point clouds obtained as random samples of an underlying "ground-truth" measure. Graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points. Many machine learning tasks, such as clustering and classification, can be posed as minimizing functionals on such graphs. We consider functionals involving graph cuts and graph laplacians and their limits as the number of data points goes to infinity. In particular we establish for what graph constructions the minimizers of discrete problems converge to a minimizer of a functional defined in the continuum setting. The talk is primarily based on joint work with Nicolas Garcia Trillos, as well as on works with Xavier Bresson, Moritz Gerlach, Matthias Hein, Thomas Laurent, James von Brecht and Matt Thorpe.

**Category**: Applied Math and Analysis**Duration**: 01:34:44**Date**: November 11, 2016 at 3:25 PM**Views**: 130-
**Tags:**seminar, Applied Math And Analysis Seminar

## 0 Comments