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)
–
Fast Attention Requires Bounded Entries
Josh Alman (Harvard)
–
Break
–
Sketching for Proving Generalization of Support Vector Machines
Kasper Larsen (Aarhus University)
–
Lunch (on your own)
–
Sketching Techniques for Kernel Density Estimation
Moses Charikar (Stanford University)
–
Memory-Regret Tradeoff for Online Learning
Binghui Peng (Columbia University)
–
Reception
–
Coffee and Check-in
–
Lightning Talks
()
–
Sketching and Projecting
Deanna Needell (University of California, Los Angeles)
–
Break
–
Sublinear Time Eigenvalue Approximation via Random Sampling
Cameron Musco (Microsoft Research New England)
–
Lunch (on your own)
–
Talk By
David Woodruff (Carnegie Mellon University)
–
Break
–
Talk By
Ken Clarkson ()
–
Open Problem Session
–
Coffee and Check-in
–
Sketching Algorithms for Max-DICUT and other CSPs
Santhoshini Velusamy (Toyota Technological Institute at Chicago)
–
Talk By
Andrew McGregor (University of Massachusetts Amherst)
–
Break
–
Tight Bounds for Volumetric Spanners in All Norms
Ali Vakilian (Toyota Technological Institute at Chicago (TTIC))
–
Lunch (on your own)
–
Robustness of Sketches to Adaptive nputs
Edith Cohen (Tel Aviv University and Google)
–
Break
–
A Near-Linear Time Algorithm for the Chamfer Distance
Piotr Indyk (MIT)
–
Discussion
–
Coffee and Check-in
–
Streaming Euclidean k-median and k-means with o(log n) Space
Samson Zhou (Texas A&M University)
–
Streaming Lower Bounds for the Needle Problems
Jiapeng Zhang (University of Southern California)
–
Break
–
Sketching Techniques for Kernel Density Estimation or for Optimal Transport Computations
Erik Waingarten (University of Pennsylvania)
–
Lunch (on your own)
–
Error Correction for Streaming Messages
Meghal Gupta (UC Berkeley)
–
Break
–
Talk By
Lee Rhodes (Oath.com)
–
Discussion
–
Coffee and Check-in
–
A Simple Quantum Sketch With Applications to Graph Algorithms
John Kallaugher (Sandia National Laboratories)
–
Resizable Sketches
Rasmus Pagh (University of Copenhagen)
–
Talk By
Sepideh Mahabadi (Microsoft Research)
Register

Registration is required to attend this workshop in person. Space may be limited, and you are advised to register early. To submit your name for consideration, please register and await confirmation of your acceptance before booking your travel. 

For additional information please visit: https://simons.berkeley.edu/participating-workshop.

Please note: the Simons Institute regularly captures photos and video of activity around the Institute for use in videos, publications, and promotional materials. 

Register Now