Schedule

Wednesday, May 6st

Time Activity Location
7:00pm – 9:00pm Reception Department of Statistics (24 Hillhouse Ave, New Haven)

Thursday, May 7st

Time Activity Title Location
8:30am – 9:00am Breakfast and Opening Remarks Room 196, Linsly Chittenden Hall
9:00am – 9:35am Peter Bartlett Pseudodimension Room 101, Linsly Chittenden Hall
9:35am – 10:10am Van Vu Dictionary Learning and Matrix Recovery with Optimal Rate Room 101, Linsly Chittenden Hall
10:10am – 10:50am Break Room 101, Linsly Chittenden Hall
10:50am – 11:25am Dan Spielman Algorithms for Lipschitz Learning on Graphs Room 101, Linsly Chittenden Hall
11:25am – 12:00pm Sekhar Tatikonda Sparse Regression Codes for Lossy Compression Room 101, Linsly Chittenden Hall
12:00pm – 2:30pm Lunch 24 Hillhouse Avenue
2:30pm – 3:05pm Sergey Bobkov Rates of convergences of one-dimensional empirical measures with respect to the transport distances Room 101, Linsly Chittenden Hall
3:05pm – 3:40pm Tony Cai Geometric Inference for General High-Dimensional Linear Inverse Problems Room 101, Linsly Chittenden Hall
3:40pm - 4:20pm Break Room 101, Linsly Chittenden Hall
4:20pm – 4:55pm Vladimir Koltchinskii Concentration properties and normal approximation for sample covariance operators and their spectral projectors Room 101, Linsly Chittenden Hall
4:55pm – 5:30pm Aditya Guntuboyina On Bayes Risk Lower Bounds Room 101, Linsly Chittenden Hall
7:00pm - 9:00pm Poster Presentations Room 101, Linsly Chittenden Hall

Friday, May 8th

Time Activity Location
8:30am – 9:00am Breakfast Room 196, Linsly Chittenden Hall
9:00am – 9:35am Iain Johnstone Optimal Shrinkage of Eigenvalues in the Spiked Covariance Model Room 101, Linsly Chittenden Hall
9:35am – 10:10am Jianqing Fan Spurious discoveries and endogeneity for Big Data Room 101, Linsly Chittenden Hall
10:10am – 10:50am Break Room 101, Linsly Chittenden Hall
10:50am – 11:25am Richard Samworth Statistical and computational trade-offs in estimation of sparse principal components Room 101, Linsly Chittenden Hall
11:25am – 12:00pm Zongming Ma Sparse CCA: Statistical and Computational Limits Room 101, Linsly Chittenden Hall
12:00pm – 2:30pm Lunch 24 Hillhouse Avenue
2:30pm – 3:05pm Richard Nickl Confidence sets for low rank inference problems, and Quantum computation Room 101, Linsly Chittenden Hall
3:05pm – 3:40pm Alexandre Tsybakov Estimation of linear and quadratic functionals under sparsity constraints Room 101, Linsly Chittenden Hall
3:40pm - 4:20pm Break Room 101, Linsly Chittenden Hall
4:20pm – 4:55pm Aad Van der Vaart Nonparametric Bayesian uncertainty quantification: confidence in credible sets? Room 101, Linsly Chittenden Hall
6:00pm – 8:30pm Banquet Greenberg Center, 391 Prospect St

Saturday, May 9th

Time Activity Location
8:30am – 9:00am Breakfast Room 196, Linsly Chittenden Hall
9:00am – 9:35am Marten Wegkamp An elementary proof of the weak convergence of empirical processes Room 101, Linsly Chittenden Hall
9:35am – 10:10am Jon A. Wellner Finite sampling inequalities: an application to two-sample Kolmogorov-Smirnov statistics Room 101, Linsly Chittenden Hall
10:10am – 10:50am Break Room 101, Linsly Chittenden Hall
10:50am – 11:25am Ming Yuan Low rank tensor estimation via nuclear norm Minimization Room 101, Linsly Chittenden Hall
11:25am – 12:00pm Cun-Hui Zhang High-Dimensional Regression, Under Low-Moment Conditions On Random Designs Room 101, Linsly Chittenden Hall
12:00pm – 2:30pm Lunch 24 Hillhouse Avenue