Workshop on Algorithms for Large Data (Online) 2021

This workshop aims to foster collaborations between researchers across multiple disciplines through a set of central questions and techniques for algorithm design for large data. We will focus on topics such as sublinear algorithms, randomized numerical linear algebra, streaming and sketching, and learning and testing.

What Workshop on Algorithms for Large Data
When Monday, August 23 - Wednesday, August 25, 2021
Where The workshop will be held virtually.

Organizers

Organizers

Registration

Registration

The workshop is now over. Thanks for your interest in attending WALDO21!

Speakers

Speakers

Schedule

Schedule
12:00 pm ET
Opening Remarks

12:05 pm ET
Robert Krauthgamer: Streaming Algorithms for Geometric Steiner Forest [Abstract]

12:30 pm ET
Sepehr Assadi: Multi-Pass Graph Streaming Lower Bounds for Parameter Estimation and Property Testing Problems [Abstract]

12:55 pm ET
Coffee Break (15 mins)

13:10 pm ET
Jelani Nelson: Optimal Bounds for Approximate Counting [Abstract]

13:35 pm ET
Sumegha Garg: The Coin Problem with Applications to Data Streams [Abstract]

14:00 pm ET
Junior-Senior Lunch (50 mins)

15:00 pm ET
Madhu Sudan: Streaming Complexity of Constraint Satisfaction Problems [Abstract]

15:25 pm ET
Alina Ene: Adaptive Gradient Descent Methods for Constrained Optimization [Abstract]

15:50 pm ET
Coffee Break (15 mins)

16:05 pm ET
Eric Price: Simulating Random Walks in Random Streams [Abstract]

16:30 pm ET
David Wajc: Streaming Submodular Matching Meets the Primal-Dual Method [Abstract]

12:00 pm ET
Opening Remarks

12:05 pm ET
Rasmus Kyng: Hardness Results for Structured Linear Equations and Programs [Abstract]

12:30 pm ET
Sofya Raskhodnikova: Isoperimetric Inequalities for the Hypercube with Applications to Monotonicity Testing [Abstract]

12:55 pm ET
Coffee Break (15 mins)

13:10 pm ET
Anna C. Gilbert: Private Inverse Problems and Source Localization [Abstract]

13:35 pm ET
Richard Peng: Fully Dynamic Effective Resistance [Abstract]

14:00 pm ET
Poster Session (50 mins)

15:00 pm ET
Santosh Vempala: Robustly Learning Mixtures of Arbitrary Gaussians in Polynomial Time [Abstract]

15:25 pm ET
David P. Woodruff: Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators [Abstract]

15:50 pm ET
Coffee Break (15 mins)

16:05 pm ET
Petros Drineas: Randomized Linear Algebra for Interior Point Methods [Abstract]

16:30 pm ET
Clément Canonne: The Price of Tolerance in Distribution Testing [Abstract]

12:00 pm ET
Opening Remarks

12:05 pm ET
Dana Ron: Optimal Distribution-Free Sample-Based Testing of Subsequence-Freeness [Abstract]

12:30 pm ET
Cameron Musco: Hutch++: Optimal Stochastic Trace Estimation [Abstract]

12:55 pm ET
Coffee Break (15 mins)

13:10 pm ET
Talya Eden: Approximating the Arboricity in Sublinear Time [Abstract]

13:35 pm ET
Jerry Li: Fast and Near-Optimal Diagonal Preconditioning [Abstract]

14:00 pm ET
Open Problem Session (50 mins)

15:00 pm ET
Sepideh Mahabadi: Two-sided Kirszbraun Theorem [Abstract]

15:25 pm ET
Christopher Musco: Linear and Sublinear Time Spectral Density Estimation [Abstract]

15:50 pm ET
Coffee Break (15 mins)

16:05 pm ET
Qin Zhang: Collaborative Learning with Communication Constraints [Abstract]

16:30 pm ET
Erik Waingarten: Sketching Geometric MST and EMD [Abstract]

Posters

Posters
Tuesday, August 24th, 2-2:30 pm ET:
Tuesday, August 24th, 2:30-3 pm ET:

Support

Support

WALD(O)'21 is generously supported by the LEarning and Algorithms for People and Systems group and the National Science Foundation. Web design by Pedro Paredes.