–
Coffee and Check-In
–
New upper and lower bounds on approximate counting
Jelani Nelson (Simons Institute)
–
Locally Private Histograms in All Privacy Regimes
Clément Canonne (University of Sydney)
–
Discussion
–
Break
–
Shaving logs by weighing coins
Deeparnab Chakrabarty (Dartmouth College)
–
Optimal Quantile Estimation for Streams
Mihir Singhal (UC Berkeley)
–
Discussion
–
Lunch (on your own)
–
O(log s)-Approximate Nearest Neighbor Search for the Earth Mover’s Distance
Rajesh Jayaram (Google Research NYC)
–
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree
Peilin Zhong (Google)
–
Efficiently Computing Similarities to Private Datasets
Sandeep Silwal (MIT)
–
Discussion
–
Reception
–
Coffee and Check-In
–
ML Efficiency for Large Models: From Data Efficiency to Faster Transformers
Vahab Mirrokni (Google Research, NYC)
–
Sub-Linear Algorithms meets Large Language Models
Anshumali Shrivastava (Rice University)
–
Discussion
–
Break
–
Randomized Least Squares Optimization and its Incredible Utility for Large-Scale Tensor Decomposition
Tamara Kolda (MathSci.ai)
–
Long-context Attention in Near-Linear Time
David Woodruff (Carnegie Mellon University)
–
Discussion
–
Lunch (on your own)
–
Sublinear-Time Algorithms in Learning
Ronitt Rubinfeld (Massachusetts Institute of Technology)
–
Differential Privacy under Continual Observation
Sofya Raskhodnikova (Boston University)
–
Large Scale Private Learning on Data Streams, and the BLTs
Abhradeep Guha Thakurta (Google DeepMind)
–
Discussion
–
Break
–
Panel on Sub-linear Algorithms Meet Practice (Not Recorded)
TBD ()
–
Coffee and Check-In
–
Sublinear Insights: A Faster (Classical) Algorithm for Edge Coloring
Sepehr Assadi (University of Waterloo and Rutgers University)
–
Linear and sublinear algorithms for graphlet sampling
Marco Bressan (University of Milan)
–
Discussion
–
Break
–
Sublinear algorithms in social networks via core-periphery decomposition
Omri Ben-Eliezer (Simons Institute)
–
Sublinear time algorithms for better than 1/2 approximation algorithms for max-cut on expanders
Akash Kumar (IIT Bombay)
–
Discussion
–
Lunch (on your own)
–
Streaming Algorithms for Connectivity Augmentation
Ali Vakilian (Toyota Technological Institute at Chicago)
–
Sublinear Algorithms in Adversarial Environment
Ilya Mironov (Google Brain)
–
Applications of Sub-linear Algorithms on Other Fields
Vladimir Braverman (Rice University)
–
Discussion
–
Break
–
Open Problem Session
–
Coffee and Check-In
–
Hypothesis selection with computational constraints
Maryam Aliakbarpour (Rice University)
–
A Bi-metric Framework for Fast Similarity Search
Piotr Indyk (Massachusetts Institute of Technology)
–
Discussion
–
Break
–
Lightning Talks
–
Lunch (on your own) and Close