Saved in:
Bibliographic Details
Main Authors: Dong, Andy, Ganesh, Arun
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2602.09338
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914318461698048
author Dong, Andy
Ganesh, Arun
author_facet Dong, Andy
Ganesh, Arun
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2602_09338
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Privacy Amplification for BandMF via $b$-Min-Sep Subsampling
Dong, Andy
Ganesh, Arun
Cryptography and Security
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.
title Privacy Amplification for BandMF via $b$-Min-Sep Subsampling
topic Cryptography and Security
url https://arxiv.org/abs/2602.09338