跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.17596 · v1

Tractable Importance Sampling for Monte Carlo Privacy Accounting

首次提交 2026-11-13 07:33
版本更新 2026-11-13 07:33
雷达观测 2026-11-17 04:58
arXiv ↗PDF ↗

摘要

Evaluating tight Differential Privacy (DP) parameters for DP matrix factorization with privacy amplification by sampling requires analyzing high-dimensional, correlated Gaussian mixtures. Because integrating these mixture distributions to find the exact privacy failure probability (δδ) is analytically intractable, these mechanisms are typically analyzed using Monte Carlo accounting. However, standard sampling suffers from prohibitive variance when estimating small δδ associated with strict privacy guarantees, which in turn requires a large sample complexity, making Monte Carlo accounting inefficient. We demonstrate that Monte Carlo accounting can be made much more efficient via importance sampling. We give a shifted importance sampling proposal distribution parameterized by a stretch factor α>1α> 1. We prove a closed-form bound B(α)<1B(α) < 1 on the support of the importance-weighted estimator that holds identically for both directions of the hockey-stick divergence, show that BB is log-convex so that the optimal αα is a one-dimensional root-finding problem, and show that the resulting estimator seamlessly plugs into the KL-Hoeffding verification protocol used by past work, with a sample complexity reduced by exactly a factor of 1/B(α∗)1/B(α^*).

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-13 07:33 · 最新观测版本

Tractable Importance Sampling for Monte Carlo Privacy Accounting

Evaluating tight Differential Privacy (DP) parameters for DP matrix factorization with privacy amplification by sampling requires analyzing high-dimensional, correlated Gaussian mixtures. Because integrating these mixture distributions to find the exact privacy failure probability (δδ) is analytically intractable, these mechanisms are typically analyzed using Monte Carlo accounting. However, standard sampling suffers from prohibitive variance when estimating small δδ associated with strict privacy guarantees, which in turn requires a large sample complexity, making Monte Carlo accounting inefficient. We demonstrate that Monte Carlo accounting can be made much more efficient via importance sampling. We give a shifted importance sampling proposal distribution parameterized by a stretch factor α>1α> 1. We prove a closed-form bound B(α)<1B(α) < 1 on the support of the importance-weighted estimator that holds identically for both directions of the hockey-stick divergence, show that BB is log-convex so that the optimal αα is a one-dimensional root-finding problem, and show that the resulting estimator seamlessly plugs into the KL-Hoeffding verification protocol used by past work, with a sample complexity reduced by exactly a factor of 1/B(α∗)1/B(α^*).

查看此版本解读 →查看此版本原文 ↗