Workshops

Fall 2013

Succinct Data Representations and Applications

Sep 16, 2013 to Sep 19, 2013

Return to event »

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.

Monday, September 16th, 2013
8:00 am–8:15 am		Coffee and Check-In
8:15 am–8:30 am		Opening Remarks
8:30 am–9:15 am		Input-sparsity Time Algorithms for Embeddings and Regression Problems Michael Mahoney, Stanford University
9:15 am–10:00 am		Something for Almost Nothing: Advances in Sub-Linear Time Algorithms Ronitt Rubinfeld, Massachusetts Institute of Technology
10:00 am–10:30 am		Break
10:30 am–11:15 am		Randomized Numerical Linear Algebra Petros Drineas, Rensselaer Polytechnic Institute
11:15 am–12:00 pm		Simple and Deterministic Matrix Sketches Edo Liberty, Yahoo! Research
12:00 pm–1:30 pm		Lunch Break
1:30 pm–2:15 pm		Optimizing with Tensors Ravi Kannan, Microsoft Research India
2:30 pm–4:00 pm		Reception at Calvin Lab

Tuesday, September 17th, 2013
8:30 am–9:00 am		Coffee and Check-In
9:00 am–9:45 am		Homomorphic Sketches: Shrinking Big Data without Sacrificing Structure Andrew McGregor, University of Massachusetts
9:45 am–10:30 am		Power to the Points: Local Certificates for Clusterings Suresh Venkatasubramanian, University of Utah
10:30 am–11:00 am		Break
11:00 am–11:45 am		How Robust are Linear Sketches to Adaptive Inputs? David Woodruff, IBM Almaden
11:45 am–12:30 pm		Nimble Algorithms for Cloud Computing Santosh Vempala, Georgia Institute of Technology
12:30 pm–2:00 pm		Lunch Break
2:00 pm–2:45 pm		Sampling for Subset Selection and Applications Amit Deshpande, Microsoft Research India
2:45 pm–3:30 pm		Spectral Sparsification of Graphs Nikhil Srivastava, Microsoft Research India
3:30 pm–4:00 pm		Break
4:00 pm–4:45 pm		Fast Testing of Graph Properties Artur Czumaj, University of Warwick
4:45 pm–5:30 pm		Inferring Structural Properties: Graphs and Bridges Anna Gilbert, University of Michigan

Wednesday, September 18th, 2013
8:30 am–9:00 am		Coffee and Check-In
9:00 am–9:45 am		Convex Relaxations for Permutation Problems Alexandre d'Aspremont, CNRS - ENS Paris
9:45 am–10:30 am		Computational and Statistical Tradeoffs via Convex Relaxation Venkat Chandrasekaran, California Institute of Technology
10:30 am–11:00 am		Break
11:00 am–11:45 am		Memory Limited, Streaming PCA Constantine Caramanis, University of Texas, Austin
11:45 am–12:30 pm		Noisy Estimation of Simultaneously Structured Models Maryam Fazel, University of Washington
12:30 pm–2:00 pm		Lunch Break
2:00 pm–2:45 pm		A Dual Approach to Sparse Optimization Michael Friedlander, University of British Columbia
2:45 pm–3:30 pm		Min-Wise Hashing for Large-Scale Regression and Classification Nicolai Meinshausen, University of Oxford and ETH Zürich
3:30 pm–4:00 pm		Break
4:00 pm–4:45 pm		Variable Selection with Error Control: Another Look at Stability Selection Richard Samworth, University of Cambridge
4:45 pm–5:30 pm		Mixed and Covariate-Dependent Graphical Models Liza Levina, University of Michigan

Thursday, September 19th, 2013
8:00 am–8:30 am		Coffee and Check-In
8:30 am–9:15 am		Succinct Representations and Efficient Algorithms Based on Linear Programming Sudipto Guha, University of Pennsylvania
9:15 am–10:00 am		Dimensionality Reduction Via Sparse Matrices Jelani Nelson, Harvard University
10:00 am–10:30 am		Break
10:30 am–11:15 am		Probabilistic Hashing Methods for Succinct Data Representations and Applications Ping Li, Rutgers University
11:15 am–12:00 pm		Optimal Detection of Sparse Signal Segments Ming Yuan, University of Wisconsin-Madison
12:00 pm–1:30 pm		Lunch Break
1:30 pm–2:15 pm		Two Concise Representations for High-Dimensional Visual Data John Wright, Columbia University
2:15 pm–3:00 pm		Structured Sparsity-Inducing Norms Through Submodular Functions Francis Bach, INRIA and ENS Paris
3:00 pm–3:30 pm		Break
3:30 pm–4:15 pm		Going Off the Grid Benjamin Recht, UC Berkeley
4:15 pm–4:30 pm		Closing Remarks