Exactly Minimax-Optimal Locally Differentially Private Sampling

Hyun-Young Park, S. Asoodeh, Si-Hyeon Lee
2/3/2026

No official code found. Best implementation: phy811/Optimal-LDP-Sampling (0 stars, last commit 2024-10-07).

Abstract

The sampling problem under local differential privacy has recently been studied with potential applications to generative models, but a fundamental analysis of its privacy-utility trade-off (PUT) remains incomplete. In this work, we define the fundamental PUT of private sampling in the minimax sense, using the f-divergence between original and sampling distributions as the utility measure. We characterize the exact PUT for both finite and continuous data spaces under some mild conditions on the data distributions, and propose sampling mechanisms that are universally optimal for all f-divergences. Our numerical experiments demonstrate the superiority of our mechanisms over baselines, in terms of theoretical utilities for finite data space and of empirical utilities for continuous data space.

View on arXivView PDF

Code Implementations(1)

Experiments for the paper "Exactly Minimax-Optimal Locally Differentially Private Sampling"

00PythonOct 2, 20242 years ago

Similar Papers

Cite this paper

@article{park2026exactly,
  title  = {Exactly Minimax-Optimal Locally Differentially Private Sampling},
  author = {Hyun-Young Park and S. Asoodeh and Si-Hyeon Lee},
  year   = {2026},
  eprint = {2410.22699},
  archivePrefix = {arXiv},
  doi    = {10.48550/arXiv.2410.22699},
  url    = {https://arxiv.org/abs/2410.22699},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2410.22699.svg)](https://codeofpaper.com/paper/2410.22699)

Discussion