arXiv Machine Learning By Vitaly Feldman, Moshe Shenfeld

Efficient privacy loss accounting for subsampling and random allocation

Read the original on arXiv Machine Learning →

arXiv:2602. 17284v2 Announce Type: replace Abstract: We consider the privacy amplification properties of a sampling scheme in which a user's data isused in $k$ steps chosen randomly and uniformly from a sequence (or set) of $t$ steps.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.