Description
| 10:00 am – 11:00 am | OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings Jelani Nelson, Harvard University |
| 11:00 am – 11:30 am | Break |
| 11:30 am – 12:30 pm | Fourier Sparsity, Spectral Norm, and the Log-Rank Conjecture Shengyu Zhang, Chinese University of Hong Kong |
| 12:30 pm – 2:30 pm | Lunch |
| 2:30 pm – 3:30 pm | Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas Vitaly Feldman, IBM Research |
| 3:30 pm – 4:00 pm | Break |
| 4:00 pm – 5:00 pm | Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees Nikhil Srivastava, Microsoft Research India |