Structure and Randomness in System Identification and Learning

January 15 - 18, 2013

Schedule


Tuesday, January 15, 2013

9:00 - 9:50
Pablo Parrilo (Massachusetts Institute of Technology)

Convex Sets, Conic Matrix Factorizations and Conic Rank Lower Bounds
PDF Presentation

10:15 - 11:05
Tong Zhang (Rutgers University-Camden)

Proximal Stochastic Dual Coordinate Ascent
PDF Presentation

11:30 - 12:20
Constantine Caramanis (University of Texas at Austin)

Crowd-Sourcing Epidemic Detection

2:30 - 3:20
Munther Dahleh (Massachusetts Institute of Technology)

Rare Probability Estimation

4:00 - 4:50
John Doyle (California Institute of Technology)

What is the probability that Munzer will see something that does not exist? A Bayesian Perspective
Presentation (PowerPoint File)


Wednesday, January 16, 2013

9:00 - 9:50
10:15 - 11:05
11:30 - 12:20
Venkat Chandrasekaran (California Institute of Technology)

Computational and Statistical Tradeoffs via Convex Relaxation

2:30 - 3:20
4:00 - 4:50

Thursday, January 17, 2013

9:00 - 9:50
Emmanuel Candes (Stanford University)

Towards a Mathematical Theory of Super-Resolution

10:15 - 11:05
11:30 - 12:20
2:00 - 2:50
Michael Mahoney (Stanford University)

Structure and Randomness in Large Informatics Graphs

3:15 - 4:05
Nathan Srebro (University of Chicago)

Tightness of Convex Relaxations to Sparsity and Rank
PDF Presentation

4:30 - 5:20

Friday, January 18, 2013

9:00 - 9:50
Joel Tropp (California Institute of Technology)

Sharp Recovery Bounds for Convex Demixing with Applications
PDF Presentation

10:15 - 11:05
Sahand Negahban (Massachusetts Institute of Technology)

Noisy Matrix Decomposition via Convex Relaxation

11:30 - 12:20
Babak Hassibi (California Institute of Technology)

Phase Recovery for Sparse Signals

2:30 - 3:20
4:00 - 4:50