依靠虚拟点计数:可观测计数与截断批次的隐私放大
Counting on Dummies: Privacy Amplification with Observable Counts and Truncated Batches
Vitaly Feldman · Audra McMillan · Kunal Talwar
中文摘要
在差分隐私随机梯度下降(DP-SGD)的许多实际部署中,服务器按批次处理数据。对这些批次进行随机采样,可通过隐私放大结果获得更好的隐私界。大多数具有可证明隐私放大的采样方案(包括泊松采样和随机分配)都会导致批次大小可变。这些方案的隐私保证要求不公开批次大小。在分布式环境中,执行聚合的服务器或任何观察通信流量的方都可能获知这些批次大小。此外,在集中式和分布式环境中,内存和计算限制可能要求每个批次不超过某个最大大小 s,当批次超过该限制时必须截断。已知这种截断会导致隐私损失显著增加。本工作通过一个简单机制应对上述两个挑战:使用随机数量的虚拟点(dummy points)来私有化批次大小,并在截断下仍保持隐私保证。我们证明该机制在分布式环境中易于实现,并针对泊松采样和随机分配给出了该机制的一般性分析。我们的分析旨在支持高效且相对紧致的隐私核算。它还通过子采样有效放大了计数发布的隐私,使得虚拟点的期望数量渐近小于直接用非负噪声私有化(敏感度为1的)批次大小所需的数量。对于带截断批次的泊松采样,我们通过实验证明,与 Ganesh (2025) 最近给出的截断直接核算相比,该机制实现了更好的隐私-效率权衡。
关键要点
- 01问题:批次大小可被观测且截断会显著增加隐私损失,现有放大方案要求不公开批次大小。
- 02方法:用随机数量的虚拟点私有化批次大小,兼容泊松采样与随机分配,并支持截断。
- 03结果:给出一般性隐私分析,支持高效紧致核算,虚拟点期望数量渐近更少。
- 04结果:在带截断的泊松采样下,隐私-效率权衡优于 Ganesh (2025) 的直接核算。
解读
尚无解读。
原始英文摘要
arXiv:2610.42139v1 Announce Type: new Abstract: In many practical deployments of Differentially Private Stochastic Gradient Descent (DP-SGD), the server processes data in batches. Randomly sampling these batches allows for better privacy bounds via privacy amplification results. Most sampling schemes with provable privacy amplification, including Poisson sampling and random allocation, result in variable batch sizes. The privacy guarantee of these schemes requires that the batch sizes are not revealed. In distributed settings, the server performing the aggregation or any party observing the communication traffic may learn these batch sizes. Furthermore, in both centralized and distributed settings, memory and computation constraints may require each batch to be of some maximum size $s$, necessitating truncation of the batch when it exceeds this limit. It is known that this truncation can result in a significant increase in privacy loss. In this work, we address both of these challenges via a simple mechanism that uses a random number of \emph{dummy points} to privatize the batch size and maintain the privacy guarantee even under truncation. We demonstrate that our mechanism is easy to implement in a distributed setting, and provide a general analysis of this mechanism for both Poisson sampling and random allocation. Our analysis is designed to support efficient and relatively tight privacy accounting. It also effectively amplifies the privacy of the count releases by subsampling, making the expected number of dummy points asymptotically smaller than what is needed to directly privatize the (sensitivity-one) batch sizes with non-negative noise. For Poisson sampling with truncated batches, we demonstrate empirically that our mechanism achieves better privacy--efficiency tradeoffs than the direct accounting for truncation recently given by (Ganesh, 2025).