A Geometric Perspective on Learning Theory and Algorithms
Speaker: Partha Niyogi, Ph.D. , University of Chicago - Department of Computer Science
Date: May 6 2008
Time: 2:00PM to 3:00PM
Location: Kiva Room (32-G449)
Host: Prof. Tomaso Poggio, CSAIL, McGovern Institute, BCS Dept.
Contact: Kathleen D. Sullivan, 617-253-0551, kdsulliv@mit.edu
Relevant URL: http://www.csail.mit.edu/events/eventcalendar/calendar.php?showAbstract: Increasingly, we face machine learning problems in very high
dimensional spaces. We proceed with the intuition that although
natural data lives in very high dimensions, they have relatively few
degrees of freedom. One way to formalize this intuition is to model
the data as lying on or near a low dimensional manifold embedded in
the high dimensional space. This point of view leads to a new class of
algorithms that are "manifold motivated" and a new set of theoretical
questions that surround their analysis. A central construction in
these algorithms is a graph or simplicial complex that is data-derived
and we will relate the geometry of these to the geometry of the
underlying manifold. Applications to embedding, clustering,
classification, and semi-supervised learning will be considered.
See other events that are part of Brains & Machines Seminar Series 2008
See other events happening in May 2008
