CORTEXA
← Browse
arxivcs.CRcs.DSmath.NAstat.APstat.ML2026-06-29

A Sieve-Accelerated Quadrature Method for Exact Privacy Accounting in the 2020 U.S. Decennial Census

Buxin Su, Weijie Su, Chendi Wang

In 2020, the U.S. Census Bureau adopted differential privacy for the Decennial Census by injecting integer-valued Gaussian noise into published census tabulations. Exactly evaluating the privacy guarantees of these data releases would enable the Bureau to determine the absolute minimum noise required to satisfy a given privacy budget, preventing the injection of unnecessary excess noise and thereby substantially enhancing the statistical utility of the data for downstream applications such as federal funding allocation and political redistricting. In this paper, we introduce a computationally efficient and mathematically rigorous quadrature method to evaluate the exact privacy profile of practical, large-scale census releases under the composition of heterogeneous discrete Gaussian mechanisms. Mathematically, this problem reduces to evaluating the tail probabilities of high-dimensional convolutions of integer-valued random variables sampled from heterogeneous discrete Gaussian distributions under exceptionally stringent numerical error tolerances (e.g., $10^{-35}$). By recasting the exact privacy accounting as a numerical integration problem via the discrete Fourier transform, we explicitly exploit the exponential convergence of the trapezoidal rule for complex analytic, periodic characteristic functions. Furthermore, to overcome the computational bottleneck of evaluating highly oscillatory integrands in high dimensions, we develop a sieve algorithm that identifies and prunes negligible quadrature nodes, accelerating the computation by three orders of magnitude. Taken together, these numerical innovations enable the first exact, assumption-free privacy accounting for the 2020 Census Demographic and Housing Characteristics File, achieving a 1,824-fold speedup over prior methods while maintaining census-mandated error tolerances.

View free PDFSource page

Related papers

arxivcs.LGcs.DSmath.NAmath.PRstat.ML2026-06-26

VGB for Masked Diffusion Model: Efficient Test-time Scaling for Reward Satisfaction and Sample Editing

Kijung Jeon, Thuy-Duong Vuong, Molei Tao

Inference-time scaling is a promising paradigm to improve generative models, especially when outputs must satisfy structural constraints or optimize downstream rewards. We consider Masked Diffusion Model (MDM) and introduce MDM-VGB, a discrete diffusion sampler that augments unma…

View free PDFSource page
arxivcs.LGcs.DCcs.DSmath.NA2026-07-01

Accelerating Discrete Diffusion Models with Parallel-In-Time Sampling

Yu Yao, Huanjian Zhou, Andi Han, Wei Huang, Masashi Sugiyama

Discrete diffusion models are widely used for learning and generating discrete distributions. As the generation process is inherently sequential, the acceleration of sampling is of significant importance. In this work, we parallelize the mainstream $τ$-leaping algorithm for absor…

View free PDFSource page
arxivcs.LGcs.DSmath.OCstat.ML2026-06-30

Distributionally Robust Linear Regression With Block Lewis Weights

Naren Sarayu Manoj, Kumar Kshitij Patel

We present an algorithm for the group distributionally robust (GDR) least squares problem. Given $m$ groups, a parameter vector in $\mathbb{R}^d$, and stacked design matrices and responses $\mathbf{A}$ and $\mathbf{b}$, our algorithm obtains a $(1+\varepsilon)$-multiplicative opt…

View free PDFSource page
arxivstat.MLcs.DScs.LGmath.PRmath.STstat.CO2026-07-14

Accelerated Mixing Time of Randomized Hamiltonian Monte Carlo

Siddharth Mitra, Vishwak Srinivasan, Xiuyuan Wang, Andre Wibisono

We show the Randomized Hamiltonian Monte Carlo (RHMC) algorithm has accelerated mixing time guarantees for sampling from log-concave probability distributions. RHMC proceeds by repeatedly simulating the continuous-time Hamiltonian dynamics for some random integration times, and r…

View free PDFSource page
arxivstat.MLcs.LGmath.NAstat.CO2026-07-24

Convergence analysis of a family of Zermelo-type iterations for the Bradley--Terry model

Ruijian Han, Ding Lu, Yiming Xu

Zermelo's algorithm is a classical method for computing the maximum likelihood estimator in the Bradley--Terry (BT) model, but its convergence can be slow in practice. To accelerate computation, Newman introduced a family of Zermelo-type fixed-point iterations parameterized by $α…

View free PDFSource page