Paper recorded by Signals 4 on 2026-10-30 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-30 on arXiv · recorded by Signals 4 on 2026-11-02
Category: cs.LG · 机器学习 · first seen 2026-11-02
In the random allocation sampling scheme each user's data is used in $k$ steps chosen randomly and uniformly from a sequence of $t$ steps. This scheme is known to improve on Poisson sampling in private optimization and in communication-efficient aggregation. The existing privacy loss distribution (PLD) accountant for this scheme runs in time quadratic in the inverse of the accuracy parameter $α$ (