Pith. sign in

REVIEW 2 cited by

A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2107.14527 v2 pith:AYWSQHOC submitted 2021-07-30 cs.DS cs.LG

classification cs.DScs.LG
keywords streamingframeworkframeworksrecentlyalgorithmsinputrobuststream
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries

    cs.DS 2025-02 conditional novelty 8.0 of 10

    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.

  2. A Simple and Robust Protocol for Distributed Counting

    cs.DC 2025-09 conditional novelty 7.0 of 10

    An adaptive attack defeats the HYZ12 distributed counting protocol, and a simplified round-based sampling protocol achieves optimal communication with white-box robustness.

Pith tools