All talks are listed in Pacific Time. *Schedule subject to change*

–
Coffee and Check-in
–
Opening Remarks
–
Randomized Embeddings and Neural Networks

Mert Pilanci (Stanford University)
Video
–
Fast Attention Requires Bounded Entries

Josh Alman (Harvard)
Video
–
Break
–
Sketching for Proving Generalization of Support Vector Machines

Kasper Larsen (Aarhus University)
Video
–
Lunch (on your own)
–
Sketching Techniques for Kernel Density Estimation

Moses Charikar (Stanford University)
Video
–
Memory-Regret Tradeoff for Online Learning

Binghui Peng (Columbia University)
Video
–
Reception
–
Coffee and Check-in
–
Lightning Talks

Video
–
Sketching and Projecting

Deanna Needell (University of California, Los Angeles)
Video
–
Break
–
Sketching Techniques for Kernel Density Estimation or for Optimal Transport Computations

Erik Waingarten (University of Pennsylvania)
Video
–
Lunch (on your own)
–
Testing Positive Semidefiniteness and Eigenvalue Approximation

David Woodruff (Carnegie Mellon University)
Video
–
Improved Frequency Estimation Algorithms with and without Predictions

Sandeep Silwal (MIT)
Video
–
Break
–
Capacity Analysis of Vector Symbolic Architectures

Ken Clarkson (IBM Research)
Video
–
Open Problem Session
–
Coffee and Check-in
–
Sketching Algorithms for Max-DICUT and other CSPs

Santhoshini Velusamy (Toyota Technological Institute at Chicago)
Video
–
A Simple (1−eps)-Approximation Adaptive Sketching Algorithm for Maximum (Weighted) Matching

Sepehr Assadi (University of Waterloo and Rutgers University)
Video
–
Break
–
Tight Bounds for Volumetric Spanners in All Norms

Ali Vakilian (Toyota Technological Institute at Chicago (TTIC))
Video
–
Lunch (on your own)
–
Robustness of Sketches to Adaptive nputs

Edith Cohen (Tel Aviv University and Google)
Video
–
Break
–
A Near-Linear Time Algorithm for the Chamfer Distance

Piotr Indyk (MIT)
Video
–
Discussion
–
Coffee and Check-in
–
Streaming Euclidean k-median and k-means with o(log n) Space

Samson Zhou (Texas A&M University)
Video
–
Streaming Lower Bounds for the Needle Problems

Jiapeng Zhang (University of Southern California)
Video
–
Break
–
Sublinear Time Eigenvalue Approximation via Random Sampling

Cameron Musco (Microsoft Research New England)
Video
–
Lunch (on your own)
–
Error Correction for Streaming Messages

Meghal Gupta (UC Berkeley)
Video
–
Break
–
Insights from Engineering Sketches for Production and Using Sketches at Scale

Lee Rhodes (Yahoo, Inc.)
Video
–
Discussion
–
Coffee and Check-in
–
A Simple Quantum Sketch With Applications to Graph Algorithms

John Kallaugher (Sandia National Laboratories)
Video
–
Resizable Sketches

Rasmus Pagh (University of Copenhagen)
Video
–
Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming

Mikkel Thorup (University of Copenhagen)
Video