Privacy Amplification for BandMF via $b$-Min-Sep Subsampling
Andy Dong, Arun Ganesh

TL;DR
This paper introduces a new subsampling method called $b$-min-sep for privacy amplification in BandMF, improving privacy guarantees especially in low-noise regimes and extending to user-level privacy.
Contribution
The paper proposes $b$-min-sep subsampling, a novel scheme that generalizes existing methods and enhances privacy amplification for BandMF, with a detailed privacy analysis and practical extensions.
Findings
$b$-min-sep matches cyclic Poisson in high noise regimes.
$b$-min-sep achieves better privacy guarantees in mid-to-low noise regimes.
Experimental results support the improved privacy guarantees.
Abstract
We study privacy amplification for BandMF, i.e., DP-SGD with correlated noise across iterations via a banded correlation matrix. We propose -min-sep subsampling, a new subsampling scheme that generalizes Poisson and balls-in-bins subsampling, extends prior practical batching strategies for BandMF, and enables stronger privacy amplification than cyclic Poisson while preserving the structural properties needed for analysis. We give a near-exact privacy analysis using Monte Carlo accounting, based on a dynamic program that leverages the Markovian structure in the subsampling procedure. We show that -min-sep matches cyclic Poisson subsampling in the high noise regime and achieves strictly better guarantees in the mid-to-low noise regime, with experimental results that bolster our claims. We further show that unlike previous BandMF subsampling schemes, our -min-sep subsampling…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Cryptography and Data Security · Mobile Crowdsensing and Crowdsourcing
