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

差分隐私算法的有效错误预测

Efficient Error Prediction for Differentially Private Algorithms

Boel Nelson

摘要:

差分隐私是一种强数学隐私概念。尽管如此,在真实数据汇集中使用差分隐私时的一个突出挑战是理解和抵消差分隐私造成的准确性损失。因此,差分隐私的准确性/隐私权衡需要在个案基础上进行平衡。文献中的应用往往只关注分析精度界限,不包括误差预测中的数据,或使用任意设置来凭经验测量误差。为了填补文献中的空白,我们提出了一种新的应用因子实验,以创建数据感知的错误预测。基本上,因素实验提供了一个系统的方法来进行实证实验。为了证明我们的方法在行动中,我们进行了一个案例研究,错误是依赖于任意复杂的树结构。我们首先构造了一个工具来模拟民意调查数据。接下来,我们使用模拟数据构建最小二乘模型来预测误差。最后,我们展示了如何验证模型。因此,我们的贡献是一种方法,用于构建数据感知的错误预测模型。

英文摘要:

Differential privacy is a strong mathematical notion of privacy. Still, a prominent challenge when using differential privacy in real data collection is understanding and counteracting the accuracy loss that differential privacy imposes. As such, the accuracy/privacy trade-off of differential privacy needs to be balanced on a case-by-case basis. Applications in the literature tend to focus solely on analytical accuracy bounds, not include data in error prediction, or use arbitrary settings to measure error empirically. To fill the gap in the literature, we propose a novel application of factor experiments to create data aware error predictions. Basically, factor experiments provide a systematic approach to conducting empirical experiments. To demonstrate our methodology in action, we conduct a case study where error is dependent on arbitrarily complex tree structures. We first construct a tool to simulate poll data. Next, we use our simulated data to construct a least squares model to predict error. Last, we show how to validate the model. Consequently, our contribution is a method for constructing error prediction models that are data aware.

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

↑