A fine-grained per-key analysis lets bottom-k cardinality sketches answer many adaptive queries when each key appears in few of them, shifting the quadratic barrier from total query count to per-key participation.
A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Classical streaming algorithms operate under the (not always reasonable) assumption that the input stream is fixed in advance. Recently, there is a growing interest in designing robust streaming algorithms that provide provable guarantees even when the input stream is chosen adaptively as the execution progresses. We propose a new framework for robust streaming that combines techniques from two recently suggested frameworks by Hassidim et al. [NeurIPS 2020] and by Woodruff and Zhou [FOCS 2021]. These recently suggested frameworks rely on very different ideas, each with its own strengths and weaknesses. We combine these two frameworks into a single hybrid framework that obtains the ``best of both worlds'', thereby solving a question left open by Woodruff and Zhou.
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
A fine-grained per-key analysis lets bottom-k cardinality sketches answer many adaptive queries when each key appears in few of them, shifting the quadratic barrier from total query count to per-key participation.