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

保护差分隐私计数机制中的目标分布

Preserving Target Distributions With Differentially Private Count Mechanisms

UC Berkeley Center for Effective Global Action(加州大学伯克利分校全球有效行动中心);UC Berkeley School of Information(加州大学伯克利分校信息学院)

Nitin Kohli, Paul Laskowski

AI总结:

针对差分隐私计数表发布中分布准确性问题,提出两阶段框架:第一阶段用循环拉普拉斯机制估计真实计数分布,第二阶段用ε-尺度构建转移矩阵,实现分布准确性与计数准确性、运行时的平衡。

摘要:

差分隐私机制越来越多地用于发布计数表,其中每个条目代表属于特定类别的个体数量。计数分布总结了计数列中的信息,将计数与类别解耦。该对象有助于回答一类研究问题,但当计数通过标准机制进行隐私化时,会受到统计偏差的影响。这激发了一个新的设计标准,我们称之为分布准确性。本研究形式化了一个两阶段框架,用于隐私化计数表,该框架平衡了分布准确性与计数准确性和运行时间这两个标准。在第一阶段,分布隐私化器生成真实计数分布的估计。我们引入了一种新的机制,称为循环拉普拉斯,专门针对计数分布,优于现有的通用差分隐私直方图机制。在第二阶段,构造算法生成一个计数机制,表示为转移矩阵,其不动点是隐私化的计数分布。我们发展了一种数学理论,用我们称为ε-尺度的简单构建块来描述这种转移矩阵。该理论指导了一种新的构造算法的设计,该算法比标准优化算法更有效地生成具有良好性质的转移矩阵。我们通过一组实验探索了我们框架的实用性,突出了不动点方法在性能标准之间提供有利权衡的情况。

英文摘要:

Differentially private mechanisms are increasingly used to publish tables of counts, where each entry represents the number of individuals belonging to a particular category. A distribution of counts summarizes the information in the count column, unlinking counts from categories. This object is useful for answering a class of research questions, but it is subject to statistical biases when counts are privatized with standard mechanisms. This motivates a novel design criterion we term accuracy of distribution. This study formalizes a two-stage framework for privatizing tables of counts that balances accuracy of distribution with two standard criteria of accuracy of counts and runtime. In the first stage, a distribution privatizer generates an estimate for the true distribution of counts. We introduce a new mechanism, called the cyclic Laplace, specifically tailored to distributions of counts, that outperforms existing general-purpose differentially private histogram mechanisms. In the second stage, a constructor algorithm generates a count mechanism, represented as a transition matrix, whose fixed-point is the privatized distribution of counts. We develop a mathematical theory that describes such transition matrices in terms of simple building blocks we call epsilon-scales. This theory informs the design of a new constructor algorithm that generates transition matrices with favorable properties more efficiently than standard optimization algorithms. We explore the practicality of our framework with a set of experiments, highlighting situations in which a fixed-point method provides a favorable tradeoff among performance criteria.

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

↑