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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要是局部差分隐私下的通用统计决策理论,未指向所列经济计量细分方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Angelika Rohde
Lukas Steinberger

局部差分隐私约束下收敛速率的几何刻画

研究问题
当原始独立同分布样本连统计分析者也无法直接获取时,局部差分隐私如何改变分布泛函估计的极小极大风险?
方法与思路
作者在固定隐私水平和正则条件下,用全变差距离对应的连续模刻画风险,并研究二元隐私化观测上的样本均值估计。
材料陈述的贡献
摘要称隐私风险由全变差连续模刻画,区别于原始数据情形的 Hellinger 连续模;凸模型的线性泛函可由简单估计达到最优速率。
阅读关注点
核对风险等价中的常数依赖、损失与模型类条件、二元隐私机制的参数选择,以及隐私水平改变时结论如何调整。
阅读边界
仅据稿件版本未注明的 OpenAlex 摘要;风险刻画有正则条件且固定隐私水平,不能推广为任意泛函或隐私强度下的结论。

原文摘要

We study the problem of estimating a functional $\theta ({\mathbb{P}})$ of an unknown probability distribution ${\mathbb{P}}\in {\mathcal{P}}$ in which the original iid sample $X_{1},\dots ,X_{n}$ is kept private even from the statistician via an $\alpha $-local differential privacy constraint. Let $\omega _{\mathrm{TV}}$ denote the modulus of continuity of the functional $\theta $ over ${\mathcal{P}}$ with respect to total variation distance. For a large class of loss functions $l$ and a fixed privacy level $\alpha $, we prove that the privatized minimax risk is equivalent to $l(\omega _{\mathrm{TV}}(n^{-1/2}))$ to within constants, under regularity conditions that are satisfied, in particular, if $\theta $ is linear and ${\mathcal{P}}$ is convex. Our results complement the theory developed by Donoho and Liu (1991) with the nowadays highly relevant case of privatized data. Somewhat surprisingly, the difficulty of the estimation problem in the private case is characterized by $\omega _{\mathrm{TV}}$, whereas, it is characterized by the Hellinger modulus of continuity if the original data $X_{1},\dots ,X_{n}$ are available. We also find that for locally private estimation of linear functionals over a convex model a simple sample mean estimator, based on independently and binary privatized observations, always achieves the minimax rate. We further provide a general recipe for choosing the functional parameter in the optimal binary privatization mechanisms and illustrate the general theory in numerous examples. Our theory allows us to quantify the price to be paid for local differential privacy in a large class of estimation problems. This price appears to be highly problem specific.

笔记与分组
相关领域论文