Tuesday, July 26

8:00 - 9:00am        Continental breakfast (provided)

9:00 - 9:10am        Welcome

9:10 - 9:35am        Raphy Coifman

9:40 - 10:05am      Pierre Vandergheynst, Wavelets and filter banks on graphs

10:10 - 10:35am    Amit Singer, Vector Diffusion Maps and the Connection Laplacian

10:35 - 11:00am    Break

11:00 - 11:25am    Justin Romberg, Parameter Estimation from Compressive Samples

11:30 - 11:55am    Tony Jebara, Multitask Sparsity via Maximum Entropy Discrimination

12:00 - 12:25pm    Andrea Bertozzi, Diffuse Interface Models on Graphs for Classification of High-Dim Data

12:30 - 1:30pm      Box lunch (provided)

1:30 - 1:55pm        Rick Chartrand, Nonconvex Splitting Algorithms and Video Decomposition

2:00 - 2:25pm        Mario Figueiredo, Alternating Direction Optimization

2:30 - 2:55pm        Donald Goldfarb, Methods for Stable Principal Component Pursuit

3:00 - 3:30pm        Break

3:30 - 3:55pm        Ben Recht, The Convex Geometry of Linear Inverse Problems

4:00 - 4:25pm        Guillermo Sapiro, The Return of PCA

7:00pm                  Heavy Hors d'œuvres at Nasher Museum of Art (included)

Wednesday, July 27

8:00 - 9:00am        Continental breakfast (provided)

9:00 - 9:25am        Robert Nowak, Sequential Analysis in High-Dimensional Multiple Testing and Sparse Recovery

9:30 - 9:55am        Babak Hassibi, Subspace Expanders and Low Rank Matrix Recovery

10:00 - 10:25am    Joel Tropp, Finding structure with randomness

10:35 - 11:00am    Break

11:00 - 11:25am    David Blei, Scalable Topic Models

11:30 - 11:55am    John Lafferty, Matrix Sparse Coding

12:00 - 12:25pm    Maya Gupta, Multi-task Averaging

12:30 - 1:30pm      Box lunch (provided)

1:30 - 1:55pm        Volkan Cevher, The CLASH Operator

2:00 - 2:25pm        Jian Li, Easy Does It: Parameter Free Dense and Sparse Spectral Estimation Algorithms

2:30 - 2:55pm        Doug Cochran, Operator-Theoretic Modeling for Radar in the Presence of Doppler

3:00 - 3:30pm        Break

3:30 - 3:55pm        Eric Xing, Smoothing Proximal Gradient Method for General Structured Sparse Regression

4:00 - 4:25pm        Walter Willinger, On a new Internet Traffic Matrix (Completion) Problem

4:30 - 4:55pm        Martin Wainwright, Sparse and Smooth: Convex relaxation for high-dim kernel regression

6:00pm                  Banquet at Washington Duke Inn (included)

                               Dinner speaker Robert Bell on Winning the Netflix Prize

                               Poster Session with Fruit and Dessert

Thursday, July 28

8:00 - 9:00am        Continental breakfast (provided)

9:00 - 9:25am        Anna Gilbert, Recovering Simple Signals

9:30 - 9:55am        Piotr Indyk, Image acquisition using sparse (pseudo)-random matrices

10:00 - 10:25am    Andrea Montanari, Shrinkage estimators for low rank matrices

10:35 - 11:00am    Break

11:00 - 11:25am    Martin Strauss, Sublinear Time, Measurement-Optimal, Sparse Recovery For All

11:30 - 11:55am    Larry Brown, A SURE Estimator for a Heteroscedastic Hierarchical Model

12:00 - 12:25pm    James Scott, Regularization with variance-mean mixtures

12:30 - 1:30pm      Box lunch (provided)

1:30 - 1:55pm        Rene Vidal, Sparsity and Rank Minimization in Unions of Subspaces

2:00 - 2:25pm        Stan Osher, Applications and Implications of Fast Methods for L1 Related Optimization

2:30 - 2:55pm        Michael Wakin, An Efficient Dictionary for Reconstruction of Sampled Multiband Signals

3:00 - 3:30pm        Break

3:30 - 3:55pm        Mike Gehm, Spectral classification sensors: An adaptive approach

4:00 - 4:25pm        Patrick Wolfe, Point process modeling for directed interaction networks

4:30 - 4:55pm        Robert Bell, Netflix Prize Winner, Principled Regularization for Matrix Factorization

5:00 - 5:05pm        Closing remarks