Iterative Algorithms

Duration: 1 hour 8 mins 45 secs
Share this media item:
Embed this media item:


About this item
Image inherited from collection
Description: Montanari, A (Stanford)
Tuesday 12 January 2010, 09:30-10:30
 
Created: 2010-01-13 14:16
Collection: Stochastic Processes in Communication Sciences
Publisher: Isaac Newton Institute
Copyright: Montanari, A
Language: eng (English)
Credits:
Author:  Montanari, A
 
Abstract: The problem of estimating a high dimensional vector from a set of linear observations arises in a number of engineering disciplines. It becomes particularly challenging when the underlying signal has some non-linear structure that needs to be exploited. I will present a new class of iterative algorithms inspired by probabilistic graphical models ideas, that appear to be asymptotically optimal in specific contexts. I will discuss in particular the application to compressed sensing problems. [Joint work with David L. Donoho and Arian Maleki]
Available Formats
Format Quality Bitrate Size
MPEG-4 Video 480x360    1.84 Mbits/sec 950.94 MB View Download
WebM 480x360    645.98 kbits/sec 321.73 MB View Download
Flash Video 480x360    805.02 kbits/sec 405.85 MB View Download
iPod Video 480x360    505.34 kbits/sec 254.77 MB View Download
QuickTime 384x288    848.75 kbits/sec 427.90 MB View Download
MP3 44100 Hz 125.0 kbits/sec 62.82 MB Listen Download
Windows Media Video 477.82 kbits/sec 240.89 MB View Download
Auto * (Allows browser to choose a format it supports)