The goal of the workshop is to bring together researchers working on different aspects of adaptive robustness to share recent developments, explore emerging connections across areas such as streaming, data structures, differential privacy, and cryptography, and foster new collaborations.
The CSE building is located in Atkinson Hall on campus. This building was designed as an instrument of research to encourage partners to combine in unusual teams to make fundamental discoveries. Atkinson Hall's interior encourages open communication and collaboration between colleagues through its open and reconfigurable design.
Edith Cohen (Google Research)
Jelani Nelson (UC Berkeley)
David P. Woodruff (Carnegie Mellon University)
Samson Zhou (Texas A&M University)
Sara Ahmadian (Google Research)
Omri Ben-Eliezer (Technion)
Guy Blanc (Stanford)
Amit Chakrabarti (Dartmouth)
Edith Cohen (Google Research)
Talya Eden (Bar-Ilan University)
Elena Gribelyuk (Princeton)
Honghao Lin (Carnegie Mellon)
Yuhan Liu (Rice)
Xin Lyu (UC Berkeley)
Jelani Nelson (UC Berkeley)
Krzysztof Onak (Boston University)
Binghui Peng (Google Research)
Barna Saha (UC San Diego)
Mihir Singhal (UC Berkeley)
Sandeep Silwal (UW Madison)
Uri Stemmer (Tel Aviv)
Chen Wang (RPI)
David P. Woodruff (Carnegie Mellon)
Samson Zhou (Texas A&M)
Monday
9:30-10: Samson Zhou: Adversarial Robustness: A Tutorial
10-10:30: Xin Lyu: Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis
10:30-11: Break
11-11:30: Omri Ben-Eliezer: Robust Streaming Against Low--Memory Adversaries
11:30-12: Uri Stemmer: Adaptive Spanners and Distributed Counting: Simpler and Better
12-2: Lunch
2-2:30: Amit Chakrabarti: A Randomness Hierarchy for Adversarially Robust Streaming Algorithms
2:30-3: Sara Ahmadian: Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
3-3:30: Mihir Singhal: One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
3:30-5: Collaborative Time
Tuesday
9:30-10: Krzysztof Onak: Techniques for Adversarially Robust Locality Sensitive Hashing
10-10:30: Guy Blanc: Adaptive and Oblivious Statistical Adversaries are Equivalent
10:30-11: Break
11-11:30: Edith Cohen: Sketching with Adaptive Inputs: Exposing Quadratic Barriers
11:30-12: Binghui Peng: High Dimensional Online Calibration in Polynomial Time
12-2: Lunch
2-2:30: David P. Woodruff: Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness, Part 1
2:30-3: Elena Gribelyuk: Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness, Part 2
3-3:30: Honghao Lin: A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches
3:30-5: Collaborative Time
Wednesday
9:30-10: Sandeep Silwal: An Adversarial Viewpoint of the Power Method
10-10:30: Chen Wang: Adversarially Robust Correlation Clustering via Sparse-Dense Decomposition
10:30-11: Break
11-11:30: Shenghao Xie: Lp Sampling in Distributed Data Streams with Applications to Adversarial Robustness
11:30-12: Yuhan Liu: Adversarially Robust Quantum State Learning and Testing
12: End of Workshop