Sublinear Algorithms Bootcamp and Workshop
June 10-13, 2018, MIT, Cambridge, MA


Bootcamp: HELD IN 32-G449 (Stata Center)

Sunday, June 10, 2018

9:30am-10:00am: Refreshments
10:00am-11:00am: Alex Andoni, Sketching as a Tool for Fast Algorithm Design Slides
11:10am-12:10pm: Krzysztof Onak, Random Local Exploration Techniques for Sublinear-Time Algorithms Slides
12:15pm-2:00pm: Lunch
2:00pm-3:00pm: David Gamarnik, Performance of local algorithms in random structures. Power and limitations slides
3:10pm-4:10pm: Yufei Zhao, Graph regularity method and applications to property testing
4:10pm-4:30pm: Short Break
4:30pm-5:30pm: Costis Daskalakis, The Challenge of High-Dimensional Statistical Hypothesis Testing Slides

Sublinear Algorithms Workshop: - HELD IN 2-190- Math Department/RefreshmentsAND Poster Session in 2-290

Monday, June 11, 2018:

9:30am-9:45am: Refreshments
9:45am-10:00am: Introduction
10:00am-10:40am: Alon Orlitsky, Two to Tons: Optimal Maxing, Ranking, and Preference Learning
10:45am-11:15am: Coffee Break
11:15am-11:55am: Ilias Diakonikolas, Recent Advances in Algorithmic High-Dimensional Robust Statistics
12:00pm-2:00pm: Lunch
2:00pm-2:40pm: Ankur Moitra, How Robust are Reconstruction Thresholds for Community Detection?
2:45pm-3:15pm: Coffee Break
3:15pm-3:55pm: Yihong Wu, Counting Motifs with Graph Sampling
4:00pm-4:40pm: Moses Charikar, Efficient Profile Maximum Likelihood for Universal Symmetric Property Estimation
4:45pm-6:30pm: Poster Session:
-Maryam Aliakbarpour, Differentially Private Identity and Equivalence Testing of Discrete Distributions
-Amartya Shankha Biswas, Local-Access Generators for Huge Random Objects
-Sebasian Brandt and Manuela Fischer, Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with n^eps Memory per Machine
-Talya Eden, On Approximating the Number of k-Cliques in a Graph
-Sutanu Gayen, Coincidence based uniformity testing achieves 1_2-tolerance
-Gautam Kamath, Sever: A Robust Meta-Algorithm for Stochastic Optimization
-Sumeet Katariya, Adaptive Ranking and Clustering
-Jason Klusowski, Counting Motifs with Graph Sampling
-Yonatan Nakar, On the Testability of Graph Partition Properties
-Ziteng Sun, Hadamard Response: Sample Optimal Distribution Estimation in Linear Time with Little Communication
-Paris Syminelakis, Integrating Functions via Distance Sensitive Hashing
-Tal Wagner, Approximate Nearest Neighbors in Limited Space and Semi-Supervised Learning on Data Streams via Temporal Label Propagation
-Peilin Zhong, Parallel Graph Connectivity in Log Diameter Rounds

Tuesday, June 12, 2018: HELD IN 2-190 Math Department/Refreshments in 2-290

9:00am -9:30am: Refreshments
9:30am-10:10am: Vladimir Braverman, Some Applications of Sublinearity
10:15am-10:55am: Michael Mitzenmacher, Metric Sublinear Algorithms via Linear Sampling
11:00am-11:30am: Coffee Break
11:30am-12:10pm: Jelani Nelson, BPTree: an l_2 heavy hitters algorithm using constant memory
12:15pm-2:15pm: Lunch
2:15pm-2:55pm: Huy Nguyen, Fast submodular maximization via approximate data structures
3:00pm-3:40pm: David Woodruff, Recent Advances in NP-hard variants of Low Rank Approximation
3:45pm-4:15pm: Coffee break
4:15pm-4:55pm: Deanna Needell, Iterative projective approach for highly corrupted linear systems
5:00pm-5:45pm Panel

Wednesday, June 13, 2018: HELD IN 2-190 Math Department/Refreshments in 2-290

9:00am -9:30am: Refreshments
9:30am-10:10am: Noga Ron Zewi, Capacity-achieving Locally List Decodable Codes
10:15am-10:55am: Parikshit Gopalan, Interactively visualizing large datasets using sketches
11:00am-11:30am: Coffee break
11:30am-12:10pm: Jacob Fox, Quantitative Property Testing
12:15pm-2:15pm: Lunch
2:15pm-2:55pm: Sofya Raskhodnikova, Erasure-Resilience vs. Tolerance to Errors
3:00pm-3:40pm: Andrea Montanari, A Mean Field View of the Landscape of Two-Layers Neural Networks
3:45pm-4:15pm: Coffee break
4:15pm-4:55pm: Artur Czumaj, Testing graph properties very efficiently