PrivTree:一个差分私有的层次分解算法
PrivTree: A Differentially Private Algorithm for Hierarchical Decompositions
摘要:
给定一个定义在域Omega上的元组集合D,我们研究了差分私有算法,用于构造Omega上的直方图来近似D中的元组分布。针对该问题的现有解决方案大多采用分层分解方法,该方法递归地将Omega划分为子域,并为每个子域计算噪声元组计数,直到所有噪声计数低于某个阈值。然而,这种方法要求我们(i)在Ω的分裂中对递归深度施加限制h,以及(ii)将每个计数中的噪声设置为与h成比例。由于以下困境,这导致较差的数据效用:如果我们使用小的h,则所得直方图将过于粗粒度,无法提供数据分布的准确近似;同时,大的h将产生细粒度直方图,但其质量将因元组计数中增加的噪声量而严重降低。为了弥补现有解决方案的不足,我们提出了PrivTree,一种直方图构造算法,它也适用于分层分解,但具有关键(有点令人惊讶)的改进:当决定是否拆分子域时,相应元组计数所需的噪声量与递归深度无关。这使得PrivTree能够自适应地生成高质量的直方图,甚至不需要预先定义子域分割深度的阈值。作为具体的例子,我们展示了PrivTree在空间数据建模中的应用,并表明它也可以扩展到处理序列数据(其中子域分裂的决定不是基于元组计数,而是一个更复杂的措施)。我们在各种真实数据集上的实验表明,PrivTree在数据效用方面显着优于现有技术。
英文摘要:
Given a set D of tuples defined on a domain Omega, we study differentially private algorithms for constructing a histogram over Omega to approximate the tuple distribution in D. Existing solutions for the problem mostly adopt a hierarchical decomposition approach, which recursively splits Omega into sub-domains and computes a noisy tuple count for each sub-domain, until all noisy counts are below a certain threshold. This approach, however, requires that we (i) impose a limit h on the recursion depth in the splitting of Omega and (ii) set the noise in each count to be proportional to h. This leads to inferior data utility due to the following dilemma: if we use a small h, then the resulting histogram would be too coarse-grained to provide an accurate approximation of data distribution; meanwhile, a large h would yield a fine-grained histogram, but its quality would be severely degraded by the increased amount of noise in the tuple counts. To remedy the deficiency of existing solutions, we present PrivTree, a histogram construction algorithm that also applies hierarchical decomposition but features a crucial (and somewhat surprising) improvement: when deciding whether or not to split a sub-domain, the amount of noise required in the corresponding tuple count is independent of the recursive depth. This enables PrivTree to adaptively generate high-quality histograms without even asking for a pre-defined threshold on the depth of sub-domain splitting. As concrete examples, we demonstrate an application of PrivTree in modelling spatial data, and show that it can also be extended to handle sequence data (where the decision in sub-domain splitting is not based on tuple counts but a more sophisticated measure). Our experiments on a variety of real datasets show that PrivTree significantly outperforms the states of the art in terms of data utility.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。