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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要聚焦局部差分隐私的通用估计界与相变,均值和密度估计本身不足以对应所列应用领域细分。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Alexander Kent
Thomas B. Berrett
Yi Yu

用户级局部差分隐私的速率最优性与相变

研究问题
每位用户持有多条观测且需要保护全部记录时,局部差分隐私下的估计误差如何取决于用户数量和每人观测数量?
方法与思路
作者推导一般极小极大风险下界,并分别为一维、多维、稀疏均值及非参数密度估计构造上下界,分析观测数量变化引发的相变。
材料陈述的贡献
摘要称上下界在对数因子范围内匹配,固定用户数时风险一般不能消失,并指出用户级隐私可使某些高维稀疏均值问题实现一致估计。
阅读关注点
应核对隐私协议与参数空间、上下界隐藏的对数因子、相变边界,以及用户级与单观测级隐私比较时固定了哪些参数。
阅读边界
仅据所给 OpenAlex 版本摘要,未核对全文或刊本变化;摘要未完整说明隐私强度及参数空间,不能仅凭样本数量判定估计可行性。

原文摘要

Most literature on differential privacy considers the item-level case where each user has a single observation, but a growing field is that of user-level privacy where each of the n users holds T observations and wishes to maintain the privacy of their entire collection. We derive a general minimax lower bound, which shows that, for locally private user-level estimation problems, the risk cannot, in general, be made to vanish for a fixed n even for T arbitrarily large. We then derive matching, up to logarithmic factors, lower and upper bounds for univariate, multidimensional, and sparse mean estimation and nonparametric density estimation. In particular, with other model parameters held fixed, we observe phase transition phenomena as T varies. In the case of (non-sparse) mean estimation and density estimation, we see that, for T below a phase transition boundary, the rate is equivalent to having nT users in the item-level setting. However, different behavior occurs with s-sparse d-dimensional mean estimation, wherein consistent estimation is impossible when d exceeds n in the item-level setting, but is possible in the user-level setting when T≳s log (d), up to logarithmic factors. This demonstrates a high-dimensional problem that is feasible under local privacy constraints. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

笔记与分组