A geometric perspective on learning theory and algorithms

1 hour 5 mins 3 secs,  59.56 MB,  MP3  44100 Hz,  125.0 kbits/sec
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Niyogi, P (Chicago)
Thursday 10 January 2008, 16:30-17:30
Contemporary Frontiers in High-Dimensional Statistical Data Analysis
 
Created: 2008-01-22 10:20
Collection: Statistical Theory and Methods for Complex, High-Dimensional Data
Publisher: Isaac Newton Institute
Copyright: Niyogi, P
Language: eng (English)
Distribution: World     (downloadable)
Credits:
Author:  Niyogi, P
Explicit content: No
Aspect Ratio: 4:3
Screencast: No
Bumper: /sms-ingest/static/new-4x3-bumper.dv
Trailer: /sms-ingest/static/new-4x3-trailer.dv
 
Abstract: 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.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 480x360    1.84 Mbits/sec 901.56 MB View Download
WebM 480x360    619.94 kbits/sec 295.14 MB View Download
Flash Video 480x360    806.31 kbits/sec 385.54 MB View Download
iPod Video 480x360    505.37 kbits/sec 241.65 MB View Download
QuickTime 384x288    848.96 kbits/sec 405.93 MB View Download
MP3 * 44100 Hz 125.0 kbits/sec 59.56 MB Listen Download
Auto (Allows browser to choose a format it supports)