arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.08397cs.DScs.CR
收藏

私有CountSketch的改进效用分析

Improved Utility Analysis of Private CountSketch

Rasmus Pagh, Mikkel Thorup

摘要:

草绘是处理稀疏(或由稀疏向量很好地近似)的高维向量的重要工具,在分布式、并行和流设置中特别有用。众所周知,草图可以通过根据草图的敏感性添加噪声来进行差异化隐私,并且这已经用于隐私分析和联邦学习设置中。差分隐私的后处理属性意味着从草图计算的所有估计可以在给定的隐私预算内发布。在本文中,我们考虑了经典的CountSketch,差分私有的高斯机制,并给出了一个改进的分析,其估计误差。也许令人惊讶的是,隐私-效用权衡基本上是人们所希望的最好结果,与CountSketch中的重复次数无关:错误几乎与非私有CountSketch的错误相同,加上在原始高维域中使向量私有所需的噪声。

英文摘要:

Sketching is an important tool for dealing with high-dimensional vectors that are sparse (or well-approximated by a sparse vector), especially useful in distributed, parallel, and streaming settings. It is known that sketches can be made differentially private by adding noise according to the sensitivity of the sketch, and this has been used in private analytics and federated learning settings. The post-processing property of differential privacy implies that all estimates computed from the sketch can be released within the given privacy budget. In this paper we consider the classical CountSketch, made differentially private with the Gaussian mechanism, and give an improved analysis of its estimation error. Perhaps surprisingly, the privacy-utility trade-off is essentially the best one could hope for, independent of the number of repetitions in CountSketch: The error is almost identical to the error from non-private CountSketch plus the noise needed to make the vector private in the original, high-dimensional domain.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑