Privacy Amplification for BandMF via b-Min-Sep Subsampling
Not on the map. Why?
Abstract (arXiv)
We study privacy amplification for BandMF, i.e., DP-SGD with correlated noise across iterations via a banded correlation matrix. We propose b-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 b-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 b-min-sep subsampling naturally extends to the multi-attribution user-level privacy setting.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 10 Feb 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Efficient privacy loss accounting for subsampling and random allocationcited by 3
- 2026High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noisecited by 2
- 2026Less Random, More Private: What is the Optimal Subsampling Scheme for DP-SGD?cited by 1
- 2026Beyond Square Roots: A Memory-Efficient Explicit Factorization for Multi-Epoch Private Learningcited by 0
- 2026High-Probability PL-SGD with Markovian Noise: Optimal Mixing and Tail Dependencecited by 0
- 2026Closed-Form Noise Calibration Against Membership Inference for Random-Allocation DP-SGDcited by 0
- 2026Closed-Form Noise Calibration Against Membership Inference for Random-Allocation DP-SGD7 Oct 2026
- 2026High-Probability PL-SGD with Markovian Noise: Optimal Mixing and Tail Dependence24 Jun 2026
- 2026Beyond Square Roots: A Memory-Efficient Explicit Factorization for Multi-Epoch Private Learning18 May 2026
- 2026Less Random, More Private: What is the Optimal Subsampling Scheme for DP-SGD?8 May 2026
- 2026High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise15 Mar 2026
- 2026Efficient privacy loss accounting for subsampling and random allocation19 Feb 2026