arXiv cs.LG
· Papers
The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting
arXiv:2607.00876v2 Announce Type: replace-cross Abstract: Private continual counting is a fundamental problem in differential privacy: given a binary stream of length $n$, where each $1$ corresponds to the contribution of one individual, the goal is to release all running counts while protecting the privacy of each ind