Universal Shuffle Asymptotics, Part II: Non-Gaussian Limits for Shuffle Privacy -- Poisson, Skellam, and Compound-Poisson Regimes
Alex Shvets

TL;DR
This paper explores the asymptotic behavior of shuffle privacy mechanisms under various regimes, revealing non-Gaussian limits like Poisson, Skellam, and compound-Poisson distributions when classical conditions fail, thus extending the universality theory.
Contribution
It characterizes the critical regimes where classical Gaussian limits break down, introducing explicit non-Gaussian limit experiments for shuffle privacy with finite alphabets.
Findings
Poisson-shift limit for binary responses under certain scaling.
Skellam-shift limit for proportional compositions.
Multivariate Poisson limit for centered histograms.
Abstract
Part I of this series (arXiv:2602.09029) develops a sharp Gaussian (LAN/GDP) limit theory for neighboring shuffle experiments when the local randomizer is fixed and has full support bounded away from zero. The present paper characterizes the first universality-breaking frontier: critical sequences of increasingly concentrated local randomizers for which classical Lindeberg conditions fail and the shuffle score exhibits rare macroscopic jumps. For shuffled binary randomized response with local privacy , we prove experiment-level convergence (in Le Cam distance) to explicit shift limit experiments: a Poisson-shift limit for the canonical neighboring pair when , and a Skellam-shift limit for proportional compositions in the same scaling, including an explicit disappearance of the two-sided…
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
TopicsRandom Matrices and Applications · Stochastic processes and statistical mechanics · Privacy-Preserving Technologies in Data
