arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.07912cs.CRcs.DS
收藏

高维图统计量和节点私有度分布的有效Lipschitz扩张

Efficient Lipschitz Extensions for High-Dimensional Graph Statistics and Node Private Degree Distributions

Sofya Raskhodnikova, Adam Smith

摘要:

Lipschitz扩展最近被提出作为设计节点差分私有算法的工具。然而,有效可计算的Lipschitz扩张仅适用于一维函数(即输出单个实值的函数)。在本文中,我们研究有效的可计算Lipschitz扩张的多维(即向量值)的功能图。我们发现,与1维函数,Lipschitz扩展的高维函数的图形并不总是存在,即使有一个非单位拉伸。我们设计的Lipschitz扩张与小拉伸的排序度列表和度分布的图。关键是,我们的扩展是有效可计算的。我们还开发了新的工具,采用Lipschitz扩展差分隐私算法的设计。具体来说,我们推广了指数机制,一个广泛使用的工具,在数据隐私。指数机制被赋予一组将数据集映射到实际值的评分函数。它试图返回在数据集上具有接近最小值的函数的名称。我们的广义指数机制提供了更好的准确性时,最佳得分函数的灵敏度是远远小于最大灵敏度的得分函数。我们使用我们的Lipschitz扩展和广义指数机制,设计一个节点差分私有算法释放一个近似图的度分布。我们的算法是更准确的算法比以前的工作。

英文摘要:

Lipschitz extensions were recently proposed as a tool for designing node differentially private algorithms. However, efficiently computable Lipschitz extensions were known only for 1-dimensional functions (that is, functions that output a single real value). In this paper, we study efficiently computable Lipschitz extensions for multi-dimensional (that is, vector-valued) functions on graphs. We show that, unlike for 1-dimensional functions, Lipschitz extensions of higher-dimensional functions on graphs do not always exist, even with a non-unit stretch. We design Lipschitz extensions with small stretch for the sorted degree list and for the degree distribution of a graph. Crucially, our extensions are efficiently computable. We also develop new tools for employing Lipschitz extensions in the design of differentially private algorithms. Specifically, we generalize the exponential mechanism, a widely used tool in data privacy. The exponential mechanism is given a collection of score functions that map datasets to real values. It attempts to return the name of the function with nearly minimum value on the data set. Our generalized exponential mechanism provides better accuracy when the sensitivity of an optimal score function is much smaller than the maximum sensitivity of score functions. We use our Lipschitz extension and the generalized exponential mechanism to design a node-differentially private algorithm for releasing an approximation to the degree distribution of a graph. Our algorithm is much more accurate than algorithms from previous work.

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

↑