Locally Optimal Private Sampling: Beyond the Global Minimax
Not on the map. Why?
Abstract (arXiv)
We study the problem of sampling from a distribution under local differential privacy (LDP). Given a private distribution P ∈ P, the goal is to generate a single sample from a distribution that remains close to P in f-divergence while satisfying the constraints of LDP. This task captures the fundamental challenge of producing realistic-looking data under strong privacy guarantees. While prior work by Park et al. (NeurIPS'24) focuses on global minimax-optimality across a class of distributions, we take a local perspective. Specifically, we examine the minimax risk in a neighborhood around a fixed distribution P0, and characterize its exact value, which depends on both P0 and the privacy level. Our main result shows that the local minimax risk is determined by the global minimax risk when the distribution class P is restricted to a neighborhood around P0. To establish this, we (1) extend previous work from pure LDP to the more general functional LDP framework, and (2) prove that the globally optimal functional LDP sampler yields the optimal local sampler when constrained to distributions near P0. Building on this, we also derive a simple closed-form expression for the locally minimax-optimal samplers which does not depend on the choice of f-divergence. We further argue that this local framework naturally models private sampling with public data, where the public data distribution is represented by P0. In this setting, we empirically compare our locally optimal sampler to existing global methods, and demonstrate that it consistently outperforms global minimax samplers.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 58 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
29 of 58 references.
References · 29
- 2020Ditto: Fair and Robust Federated Learning Through Personalizationcited by 665
- 2013The Composition Theorem for Differential Privacycited by 290
- 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 262
- 2018Differentially Private Generative Adversarial Networkcited by 235
- 2020Personalized Federated Learning with First Order Model Optimizationcited by 201
- 2017Collecting Telemetry Data Privatelycited by 147
- 2020DP-CGAN: Differentially Private Synthetic Data and Label Generationcited by 118
- 2021Learning with User-Level Privacycited by 72
- 2019PPGAN: Privacy-preserving Generative Adversarial Networkcited by 34
- 2024Differentially Private Next-Token Prediction of Large Language Modelscited by 21
- 2022Discrete Distribution Estimation under User-level Local Differential Privacycited by 17
- 2023Federated Linear Contextual Bandits with User-level Differential Privacycited by 12
17 more
- 2024A Huber Loss Minimization Approach to Mean Estimation under User-level Differential Privacycited by 11
- 2022GeoPointGAN: Synthetic Spatial Data with Local Label Differential Privacycited by 9
- 2024Instance-Optimal Private Density Estimation in the Wasserstein Distancecited by 9
- 2022Contraction of Locally Differentially Private Mechanismscited by 8
- 2022Differentially Private Sampling from Distributionscited by 8
- 2022Instance-Optimal Differentially Private Estimationcited by 7
- 2023On Differentially Private Sampling from Gaussian and Product Distributionscited by 6
- 2024Rate Optimality and Phase Transition for User-Level Local Differential Privacycited by 6
- 2022Local Differential Privacy Image Generation Using Flow-based Deep Generative Modelscited by 5
- 2024Metric Differential Privacy at the User-Level Via the Earth Mover's Distancecited by 5
- 2024Exactly Minimax-Optimal Locally Differentially Private Samplingcited by 5
- 2024Adaptively Private Next-Token Prediction of Large Language Modelscited by 4
- 2024Locally Private Sampling with Public Datacited by 3
- 2024PrivShape: Extracting Shapes in Time Series under User-Level Local Differential Privacycited by 2
- 2024Differentially Private Multi-Sampling from Distributionscited by 2
- 2025Optimal Differentially Private Sampling of Unbounded Gaussianscited by 1
- 2025Reveal-or-Obscure: A Differentially Private Sampling Algorithm for Discrete Distributionscited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.