SPEAKER  |  Mauro Maggioni

INSTITUTE  |  

DATE  |  May 10(Wed), 2017

TIME  |  12:00

PLACE  |  1503

Keyword  |  

Download  |  

ABSTRACT  |  We discuss a family of ideas, algorithms, and results for analyzing various new and classical problems in the analysis of high-dimensional data sets. These methods we discuss perform well when data is sampled from a probability measure in high-dimensions that is concentrated near a low-dimensional set. They rely on the idea of performing suitable multiscale geometric decompositions of the data, and exploiting such decompositions to perform a variety of tasks in signal processing and statistical learning. In particular we will discuss the problem of dictionary learning, of regression, of learning the probability measure generating the data, and efficiently computing optimal transportation plans between probability measures. These are joint works with W. Liao, S. Vigogna and S. Gerber.