跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要聚焦差分隐私机制与一般假设检验,未明确对应所列经济计量细分。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Jordan Awan
Salil Vadhan

典范噪声分布与隐私假设检验

研究问题
在一般 f-DP 隐私保证下,如何构造与保证匹配的加性噪声,并据此设计有效的隐私检验和无需额外隐私成本的 p 值发布机制?
方法与思路
作者定义并构造典范噪声分布,建立其与隐私检验的联系;针对比例差检验,以半隐私最优无偏检验为基准,提出特征函数反演方法。
材料陈述的贡献
摘要称,典范噪声分布总是存在,并可支持二元数据的最优检验;所提比例差检验接近半隐私基准,特定隐私设定下还有经验比较。
阅读关注点
应核对 f-DP 与典范噪声的定义、最优检验所覆盖的检验类、半隐私基准的约束,以及功效比较使用的隐私预算是否可比。
阅读边界
仅据版本未注明的 OpenAlex 摘要,不能将特定设定中的经验功效比较推广为普遍优势;最优性和隐私成本结论的具体条件未说明。

原文摘要

f-DP has recently been proposed as a generalization of differential privacy allowing a lossless analysis of composition, post-processing, and privacy amplification via subsampling. In the setting of f-DP, we propose the concept of a canonical noise distribution (CND), the first mechanism designed for an arbitrary f-DP guarantee. The notion of CND captures whether an additive privacy mechanism perfectly matches the privacy guarantee of a given f. We prove that a CND always exists, and give a construction that produces a CND for any f. We show that private hypothesis tests are intimately related to CNDs, allowing for the release of private p-values at no additional privacy cost, as well as the construction of uniformly most powerful (UMP) tests for binary data, within the general f-DP framework. We apply our techniques to the problem of difference-of-proportions testing, and construct a UMP unbiased (UMPU) “semiprivate” test which upper bounds the performance of any f-DP test. Using this as a benchmark, we propose a private test based on the inversion of characteristic functions, which allows for optimal inference on the two population parameters and is nearly as powerful as the semiprivate UMPU. When specialized to the case of (ϵ,0)-DP, we show empirically that our proposed test is more powerful than any (ϵ/ 2)-DP test and has more accurate type I errors than the classic normal approximation test.

笔记与分组
相关领域论文