arXiv:2411.07094cs.LGcs.IT2024-11被引 2

私有协作下在线个性化均值估计,提升收敛速度且保护隐私。

Differentially-Private Collaborative Online Personalized Mean Estimation

  • 结合假设检验与差分隐私,动态估计数据方差实现私有协作。
  • 理论证明合作收敛快于本地独立估计,数值实验验证其接近公开数据理想性能。
  • 适合关注在线隐私保护与协同学习的系统设计者与研究人员。

我们研究在多个智能体持续接收未知分布数据的环境下,受隐私约束的协同个性化均值估计问题。提出一种基于假设检验、差分隐私与数据方差估计的方法,设计两种隐私机制和两种方差估计方案。针对任意有界未知分布,提供算法的理论收敛性分析,表明协作比完全本地化方法收敛更快。进一步给出已知代理类别结构(同均值分布归为一类)时的解析性能曲线。理论上的超本地收敛优势得到大量数值实验支持:所提方法在给定场景中收敛速度远超本地方法,且性能接近所有数据公开的理想情况,验证了在线私有协作的有效性。

原文摘要 · Abstract (English)

We consider the problem of collaborative personalized mean estimation under a privacy constraint in an environment of several agents continuously receiving data according to arbitrary unknown agent-specific distributions. In particular, we provide a method based on hypothesis testing coupled with differential privacy and data variance estimation. Two privacy mechanisms and two data variance estimation schemes are proposed, and we provide a theoretical convergence analysis of the proposed algorithm for any bounded unknown distributions on the agents' data, showing that collaboration provides faster convergence than a fully local approach where agents do not share data. Moreover, we provide analytical performance curves for the case with an oracle class estimator, i.e., the class structure of the agents, where agents receiving data from distributions with the same mean are considered to be in the same class, is known. The theoretical faster-than-local convergence guarantee is backed up by extensive numerical results showing that for a considered scenario the proposed approach indeed converges much faster than a fully local approach, and performs comparably to ideal performance where all data is public. This illustrates the benefit of private collaboration in an online setting.

隐私计算在线学习协同估计

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。