Short Course: Sparse Representations and High Dimensional Geometry : In conjunction with the AMS 2007 Von Neumann Symposium - IPAM

Short Course: Sparse Representations and High Dimensional Geometry : In conjunction with the AMS 2007 Von Neumann Symposium

May 30 - June 1, 2007

Schedule

All times in this Schedule are Pacific Time (PT)

Wednesday, May 30, 2007

Morning Session

08:00-08:45
Check-In/Light Breakfast (Hosted by IPAM)
08:45-09:00
Welcome and Opening Remarks
09:00-09:50
Joel Tropp (California Institute of Technology)
An Introduction to Matching Pursuits: Lecture I
09:50-10:00
Break
10:00-10:50
Joel Tropp (California Institute of Technology)
An Introduction to Matching Pursuits: Lecture II
10:50-11:20
Break
11:20-12:10
Joel Tropp (California Institute of Technology)
An Introduction to Matching Pursuits: Lecture III

Afternoon Session

12:10-14:00
Lunch (on your own)
14:00-14:50
Roman Vershynin (University of California, Davis (UC Davis))
Analysis of Random Measurements: Lecture I
14:50-15:20
Break
15:20-16:10
Roman Vershynin (University of California, Davis (UC Davis))
Analysis of Random Measurements: Lecture II
16:10-16:20
Break
16:20-17:10
Roman Vershynin (University of California, Davis (UC Davis))
Analysis of Random Measurements: Lecture III
17:15-19:00
Reception (Location: IPAM Lobby)

Thursday, May 31, 2007

Morning Session

08:00-09:00
Breakfast (Hosted by IPAM)
09:00-09:50
Anna Gilbert (University of Michigan)
What makes sublinear algorithms so fast? Lecture I
09:50-10:00
Break
10:00-10:50
Anna Gilbert (University of Michigan)
What makes sublinear algorithms so fast? Lecture II
10:50-11:00
Break
11:00-11:50
Anna Gilbert (University of Michigan)
What makes sublinear algorithms so fast? Lecture III

Afternoon Session

12:00-13:00
Lunch (on your own)
13:00-13:50
Michael Mahoney (Yahoo! Research)
Randomized algorithms for optimization, learning, and data
13:50-14:00
Break
14:00-14:40
Michael Mahoney (Yahoo! Research)
Randomized algorithms for optimization, learning, and data
14:40-14:50
Break
14:50-15:40
Jared Tanner (University of Edinburgh)
Convex Relaxation and Polytopes: Lecture I
15:40-15:50
Break
15:50-16:40
Jared Tanner (University of Edinburgh)
Convex Relaxation and Polytopes: Lecture II
16:40-16:50
Break
16:50-17:40
Jared Tanner (University of Edinburgh)
Convex Relaxation and Polytopes: Lecture III

Friday, June 1, 2007

Morning Session

08:00-09:00
Breakfast (Hosted by IPAM)
09:00-09:50
Justin Romberg (Georgia Institute of Technology)
Uncertainty Principles and Sparse Recovery: Lecture I
09:50-10:00
Break
10:00-10:50
Justin Romberg (Georgia Institute of Technology)
Uncertainty Principles and Sparse Recovery: Lecture II
10:50-11:20
Break
11:20-12:10
Justin Romberg (Georgia Institute of Technology)
Uncertainty Principles and Sparse Recovery: Lecture III

Afternoon Session

12:10-14:00
Lunch (on your own)
14:00-14:50
Jing Zou (University of Maryland)
The Super Fast Sparse Fourier Algorithms: Lecture I
14:50-15:00
Break
15:00-15:50
Jing Zou (University of Maryland)
The Super Fast Sparse Fourier Algorithms: Lecture II
15:50-16:20
Break
16:20-17:10
Bedros Afeyan (Polymath Research, Inc.)
Exploiting Sparsity While Extracting Morphological Diversity in Physics and Technology
17:10
Conclusion
Printable Version