Differentially Private Wasserstein Barycenters

Anming Gu, Sasidhar Kunapuli, Mark Bun, Edward Chien, Kristjan Greenewald
10/3/2025
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

The Wasserstein barycenter is defined as the mean of a set of probability measures under the optimal transport metric, and has numerous applications spanning machine learning, statistics, and computer graphics. In practice these input measures are empirical distributions built from sensitive datasets, motivating a differentially private (DP) treatment. We present, to our knowledge, the first algorithms for computing Wasserstein barycenters under differential privacy. Empirically, on synthetic data, MNIST, and large-scale U.S. population datasets, our methods produce high-quality private barycenters with strong accuracy-privacy tradeoffs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{gu2025differentially,
  title  = {Differentially Private Wasserstein Barycenters},
  author = {Anming Gu and Sasidhar Kunapuli and Mark Bun and Edward Chien and Kristjan Greenewald},
  year   = {2025},
  eprint = {2510.03021},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.03021v1}
}

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/2510.03021.svg)](https://codeofpaper.com/paper/2510.03021)

Discussion