Co-occurring keywords · papers mentioning both
Papers
Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
NeurIPS 2024
Optimal Sketching for Residual Error Estimation for Matrix and Vector Norms
ICLR 2024
Differentially Private L_2-Heavy Hitters in the Sliding Window Model
ICLR 2023
Federated Heavy Hitter Recovery under Linear Sketching
ICML 2023
Improved Frequency Estimation Algorithms with and without Predictions
NeurIPS 2023
Tricking the Hashing Trick: A Tight Lower Bound on the Robustness of CountSketch to Adaptive Inputs
AAAI 2023
Asymptotically Optimal Locally Private Heavy Hitters via Parameterized Sketches
AISTATS 2022
On the Robustness of CountSketch to Adaptive Inputs
ICML 2022
Linear and Kernel Classification in the Streaming Model: Improved Bounds for Heavy Hitters
NeurIPS 2021
Putting the “Learning" into Learning-Augmented Algorithms for Frequency Estimation
ICML 2021
The Sparse Vector Technique, Revisited
COLT 2021
Toward Nearly-Zero-Error Sketching via Compressive Sensing
NSDI 2021
Practical Locally Private Heavy Hitters
JMLR 2020
Sublinear Space Private Algorithms Under the Sliding Window Model
ICML 2019
Finding Frequent Entities in Continuous Data
IJCAI 2018
Practical Locally Private Heavy Hitters
NeurIPS 2017