Table of Contents
Fetching ...

Optimal Differentially Private Sampling of Unbounded Gaussians

Valentio Iverson, Gautam Kamath, Argyris Mouzakis

TL;DR

This work addresses private sampling from high-dimensional Gaussians with unknown and potentially unbounded covariance matrices under $(\varepsilon,\delta)$-DP. It combines covariance-aware mean estimation primitives from Brown, Hopkins, and Smith with a privacy-preserving sampling framework inspired by Ghazi, Hu, Kumar, and Manurangsi, and augments it with a Propose-Test-Release step to certify data quality. The result is a near-optimal sampler with $\widetilde{O}(d)$ samples that achieves $d_{TV}$-closeness to the target Gaussian, significantly reducing previous dependence on the ambient dimension. This advances private generative-model applications by enabling efficient, private sampling without fully learning the covariance, and it tightens the gap between private sampling and private distribution learning in the unbounded-covariance regime.

Abstract

We provide the first $\widetilde{\mathcal{O}}\left(d\right)$-sample algorithm for sampling from unbounded Gaussian distributions under the constraint of $\left(\varepsilon, δ\right)$-differential privacy. This is a quadratic improvement over previous results for the same problem, settling an open question of Ghazi, Hu, Kumar, and Manurangsi.

Optimal Differentially Private Sampling of Unbounded Gaussians

TL;DR

This work addresses private sampling from high-dimensional Gaussians with unknown and potentially unbounded covariance matrices under -DP. It combines covariance-aware mean estimation primitives from Brown, Hopkins, and Smith with a privacy-preserving sampling framework inspired by Ghazi, Hu, Kumar, and Manurangsi, and augments it with a Propose-Test-Release step to certify data quality. The result is a near-optimal sampler with samples that achieves -closeness to the target Gaussian, significantly reducing previous dependence on the ambient dimension. This advances private generative-model applications by enabling efficient, private sampling without fully learning the covariance, and it tightens the gap between private sampling and private distribution learning in the unbounded-covariance regime.

Abstract

We provide the first -sample algorithm for sampling from unbounded Gaussian distributions under the constraint of -differential privacy. This is a quadratic improvement over previous results for the same problem, settling an open question of Ghazi, Hu, Kumar, and Manurangsi.

Paper Structure

This paper contains 11 sections, 11 theorems, 22 equations, 2 algorithms.

Key Result

Lemma 2.8

Let $M_1: \mathcal{X}^n \to \mathcal{Y}_1 \cup \mathopen{}\mathclose{\left\{ \texttt{Fail} \right\}, M_2: \mathcal{Y}_1 \times \mathcal{X}^n \to \mathcal{Y}_2$ be algorithms. Furthermore, let $M$ denote the following algorithm: let $y_1 \coloneqq M_1\mathopen{}\mathclose{\left( X} \right)$ and, if $

Theorems & Definitions (26)

  • Definition 2.1
  • Definition 2.2
  • Remark 2.3
  • Definition 2.4: Approximate Differential Privacy (DP) DworkMNS06
  • Remark 2.5
  • Remark 2.6
  • Definition 2.7: DP under condition KothariMV22
  • Lemma 2.8: Composition for Algorithm with Halting KothariMV22
  • Lemma 3.1: Lemma $11$ from BrownHS23
  • Definition 3.2: Definition $32$ from BrownHS23
  • ...and 16 more