arXiv:2411.08791cs.LG2024-11被引 3

用户既有私有数据又有公开数据时,如何在保护隐私的前提下高效采样。

Locally Private Sampling with Public Data

  • 设计一种基于最小最大优化的隐私采样框架,同时保护私有和公开数据分布。
  • 理论证明最优机制对所有f-散度均适用,且在离散分布下完全可解。
  • 实验证明优于现有最先进方法,适合多源数据隐私建模场景。

局部差分隐私(LDP)被广泛用于隐私保护机器学习,以在数据上传前保护用户隐私。现有LDP方法通常假设每个用户仅有一条数据记录,但现实中用户常拥有大量私有数据(如图像、文本、时间序列),且往往可访问公开数据集。为解决此局限,本文提出一种融合私有与公开数据的局部私有采样框架。假设每位用户拥有两个分布:$p$(私有数据)和 $q$(公开数据),目标是设计一个机制,生成近似 $p$ 的私有样本,同时保持 $q$ 不被泄露。该目标被建模为以 $f$-散度为效用度量的最小最大优化问题。本文在 $p$ 和 $q$ 为离散分布的前提下,完全刻画了通用 $f$-散度下的最小最大最优机制。令人惊讶的是,该最优机制对所有 $f$-散度均具有普适性。实验验证了所提最小最大最优采样器在性能上优于当前最先进的本地私有采样方法。

原文摘要 · Abstract (English)

Local differential privacy (LDP) is increasingly employed in privacy-preserving machine learning to protect user data before sharing it with an untrusted aggregator. Most LDP methods assume that users possess only a single data record, which is a significant limitation since users often gather extensive datasets (e.g., images, text, time-series data) and frequently have access to public datasets. To address this limitation, we propose a locally private sampling framework that leverages both the private and public datasets of each user. Specifically, we assume each user has two distributions: $p$ and $q$ that represent their private dataset and the public dataset, respectively. The objective is to design a mechanism that generates a private sample approximating $p$ while simultaneously preserving $q$. We frame this objective as a minimax optimization problem using $f$-divergence as the utility measure. We fully characterize the minimax optimal mechanisms for general $f$-divergences provided that $p$ and $q$ are discrete distributions. Remarkably, we demonstrate that this optimal mechanism is universal across all $f$-divergences. Experiments validate the effectiveness of our minimax optimal sampler compared to the state-of-the-art locally private sampler.

隐私计算差分隐私采样机制数据融合

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