Adversarially Robust Streaming Algorithms via Differential Privacy
Not on the map. Why?
Abstract (arXiv)
A streaming algorithm is said to be adversarially robust if its accuracy guarantees are maintained even when the data stream is chosen maliciously, by an adaptive adversary. We establish a connection between adversarial robustness of streaming algorithms and the notion of differential privacy. This connection allows us to design new adversarially robust streaming algorithms that outperform the current state-of-the-art constructions for many interesting regimes of parameters.
Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 5; 2023: 6; 2024: 3; 2025: 2.
21 papers.
Sort:
By area:
- 2021Adaptive Machine Unlearningcited by 164
- 2021Adversarial Laws of Large Numbers and Optimal Regret in Online Classificationcited by 39
- 2023Near Optimal Memory-Regret Tradeoff for Online Learningcited by 15
- 2021Adversarial Robustness of Streaming Algorithms through Importance Samplingcited by 13
- 2021A Framework for Adversarial Streaming via Differential Privacy and Difference Estimatorscited by 9
- 2022Adaptive Data Analysis with Correlated Observationscited by 9
- 2022Uniform Approximations for Randomized Hadamard Transforms with Applicationscited by 7
- 2023Unbounded Differentially Private Quantile and Maximum Estimationcited by 6
- 2022On the Robustness of CountSketch to Adaptive Inputscited by 5
- 2023Streaming Algorithms for Learning with Experts: Deterministic Versus Robustcited by 3
- 2023Hot PATE: Private Aggregation of Distributions for Diverse Taskcited by 3
- 2024Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysiscited by 3
9 more
- 2022The Complexity of Dynamic Least-Squares Regressioncited by 2
- 2022Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputscited by 2
- 2021Smoothed Differential Privacycited by 1
- 2023Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Modelcited by 0
- 2023Adversarially Robust Distributed Count Tracking via Partial Differential Privacycited by 0
- 2024Fast White-Box Adversarial Streaming Without a Random Oraclecited by 0
- 2024Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noisecited by 0
- 2025The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for ℓ2 Norm Estimationcited by 0
- 2025Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programmingcited by 0
- 2025Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming21 Sep 2025
- 2025The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for ℓ2 Norm Estimation22 Jul 2025
- 2024Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis18 Dec 2024
- 2024Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise29 Jul 2024
- 2024Fast White-Box Adversarial Streaming Without a Random Oracle10 Jun 2024
- 2023Hot PATE: Private Aggregation of Distributions for Diverse Task4 Dec 2023
- 2023Adversarially Robust Distributed Count Tracking via Partial Differential Privacy1 Nov 2023
- 2023Unbounded Differentially Private Quantile and Maximum Estimation2 May 2023
- 2023Streaming Algorithms for Learning with Experts: Deterministic Versus Robust3 Mar 2023
- 2023Near Optimal Memory-Regret Tradeoff for Online Learning3 Mar 2023
- 2023Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model22 Jan 2023
- 2022Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs3 Jul 2022
9 more
- 2022Uniform Approximations for Randomized Hadamard Transforms with Applications3 Mar 2022
- 2022On the Robustness of CountSketch to Adaptive Inputs28 Feb 2022
- 2022Adaptive Data Analysis with Correlated Observations21 Jan 2022
- 2022The Complexity of Dynamic Least-Squares Regression1 Jan 2022
- 2021A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators30 Jul 2021
- 2021Smoothed Differential Privacy4 Jul 2021
- 2021Adversarial Robustness of Streaming Algorithms through Importance Sampling28 Jun 2021
- 2021Adaptive Machine Unlearning8 Jun 2021
- 2021Adversarial Laws of Large Numbers and Optimal Regret in Online Classification22 Jan 2021
- 2021Adaptive Machine Unlearningcited by 164
- 2021Adaptive Machine Unlearning8 Jun 2021
- 2021Adversarial Laws of Large Numbers and Optimal Regret in Online Classificationcited by 39
- 2023Near Optimal Memory-Regret Tradeoff for Online Learningcited by 15
- 2021Adversarial Robustness of Streaming Algorithms through Importance Samplingcited by 13
- 2021A Framework for Adversarial Streaming via Differential Privacy and Difference Estimatorscited by 9
- 2022Adaptive Data Analysis with Correlated Observationscited by 9
- 2022Uniform Approximations for Randomized Hadamard Transforms with Applicationscited by 7
- 2023Unbounded Differentially Private Quantile and Maximum Estimationcited by 6
- 2022On the Robustness of CountSketch to Adaptive Inputscited by 5
- 2023Streaming Algorithms for Learning with Experts: Deterministic Versus Robustcited by 3
- 2023Hot PATE: Private Aggregation of Distributions for Diverse Taskcited by 3
- 2024Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysiscited by 3
- 2022The Complexity of Dynamic Least-Squares Regressioncited by 2
12 most cited of 20 All 20 (JSON)
- 2025Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming21 Sep 2025
- 2025The Cost of Compression: Tight Quadratic Black-Box Attacks on Sketches for ℓ2 Norm Estimation22 Jul 2025
- 2024Fingerprinting Codes Meet Geometry: Improved Lower Bounds for Private Query Release and Adaptive Data Analysis18 Dec 2024
- 2024Unleash the Power of Ellipsis: Accuracy-enhanced Sparse Vector Technique with Exponential Noise29 Jul 2024
- 2024Fast White-Box Adversarial Streaming Without a Random Oracle10 Jun 2024
- 2023Hot PATE: Private Aggregation of Distributions for Diverse Task4 Dec 2023
- 2023Adversarially Robust Distributed Count Tracking via Partial Differential Privacy1 Nov 2023
- 2023Unbounded Differentially Private Quantile and Maximum Estimation2 May 2023
- 2023Streaming Algorithms for Learning with Experts: Deterministic Versus Robust3 Mar 2023
- 2023Near Optimal Memory-Regret Tradeoff for Online Learning3 Mar 2023
- 2023Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model22 Jan 2023
- 2022Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs3 Jul 2022
12 newest of 20 All 20 (JSON)