cs.CRNov 12, 2026

Tractable Importance Sampling for Monte Carlo Privacy Accounting

Authors: Galen Andrew, Arun Ganesh

Organizations: Google Research

Abstract

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(α^*).

Figures & tables

Explore similar work

CardsList
  1. Sampling-Free Privacy Accounting for Matrix Mechanisms under Random Allocation

    Jan 29, 2026Jan Schuchardt, Nikita KalininPrivacy AccountingDifferential Privacy

  2. Efficient privacy loss accounting for subsampling and random allocation

    Feb 19, 2026Vitaly Feldman, Moshe ShenfeldPrivacy AccountingDifferential Privacy