• Click on the titles of individual talks for abstract, slides and archived video.

All talks will take place in the Chevron Auditorium, International House, UC Berkeley. The reception on Monday afternoon will be held at Calvin Lab.

–
Coffee and Check-In
–
Opening Remarks
–
Input-sparsity Time Algorithms for Embeddings and Regression Problems
Michael Mahoney (International Computer Science Institute and UC Berkeley)
–
Something for Almost Nothing: Advances in Sub-Linear Time Algorithms
Ronitt Rubinfeld, Massachusetts Institute of Technology
–
Break
–
Randomized Numerical Linear Algebra
Petros Drineas (Purdue University)
–
Simple and Deterministic Matrix Sketches
Edo Liberty, Yahoo! Research
–
Lunch Break
–
Optimizing with Tensors
Ravi Kannan (Microsoft Research India)
–
Reception at Calvin Lab
–
Coffee and Check-In
–
Homomorphic Sketches: Shrinking Big Data without Sacrificing Structure
Andrew McGregor (University of Massachusetts Amherst)
–
Power to the Points: Local Certificates for Clusterings
Suresh Venkatasubramanian (University of Utah)
–
Break
–
How Robust are Linear Sketches to Adaptive Inputs?
David Woodruff (Carnegie Mellon University)
–
Nimble Algorithms for Cloud Computing
Santosh Vempala, Georgia Institute of Technology
–
Lunch Break
–
Sampling for Subset Selection and Applications
Amit Deshpande, Microsoft Research India
–
Spectral Sparsification of Graphs
Nikhil Srivastava (Simons Institute, UC Berkeley)
–
Break
–
Fast Testing of Graph Properties
Artur Czumaj, University of Warwick
–
Inferring Structural Properties: Graphs and Bridges
Anna Gilbert, University of Michigan
–
Coffee and Check-In
–
Convex Relaxations for Permutation Problems
Alexandre d'Aspremont, CNRS - ENS Paris
–
Computational and Statistical Tradeoffs via Convex Relaxation
Venkat Chandrasekaran, California Institute of Technology
–
Break
–
Memory Limited, Streaming PCA
Constantine Caramanis, University of Texas, Austin
–
Noisy Estimation of Simultaneously Structured Models
Maryam Fazel, University of Washington
–
Lunch Break
–
A Dual Approach to Sparse Optimization
Michael Friedlander, University of British Columbia
–
Min-Wise Hashing for Large-Scale Regression and Classification
Nicolai Meinshausen, University of Oxford and ETH Zürich
–
Break
–
Variable Selection with Error Control: Another Look at Stability Selection
Richard Samworth (University of Cambridge)
–
Mixed and Covariate-Dependent Graphical Models
Liza Levina, University of Michigan
–
Coffee and Check-In
–
Succinct Representations and Efficient Algorithms Based on Linear Programming
Sudipto Guha, University of Pennsylvania
–
Dimensionality Reduction Via Sparse Matrices
Jelani Nelson, Harvard University
–
Break
–
Probabilistic Hashing Methods for Succinct Data Representations and Applications
Ping Li, Rutgers University
–
Optimal Detection of Sparse Signal Segments
Ming Yuan, University of Wisconsin-Madison
–
Lunch Break
–
Two Concise Representations for High-Dimensional Visual Data
John Wright, Columbia University
–
Structured Sparsity-Inducing Norms Through Submodular Functions
Francis Bach (INRIA and École Normale Supérieure Paris)
–
Break
–
Going Off the Grid
Benjamin Recht (UC Berkeley)
–
Closing Remarks