Private Wasserstein Distance

Wenqian Li, Yan Pang
4/10/2024
cs.LGcs.AI

No official code found. Best implementation: muz1lee/MOTdata (18 stars, MIT, last commit 2025-03-24).

Abstract

Wasserstein distance is a key metric for quantifying data divergence from a distributional perspective. However, its application in privacy-sensitive environments, where direct sharing of raw data is prohibited, presents significant challenges. Existing approaches, such as Differential Privacy and Federated Optimization, have been employed to estimate the Wasserstein distance under such constraints. However, these methods often fall short when both accuracy and security are required. In this study, we explore the inherent triangular properties within the Wasserstein space, leading to a novel solution named TriangleWad. This approach facilitates the fast computation of the Wasserstein distance between datasets stored across different entities, ensuring that raw data remain completely hidden. TriangleWad not only strengthens resistance to potential attacks but also preserves high estimation accuracy. Through extensive experiments across various tasks involving both image and text data, we demonstrate its superior performance and significant potential for real-world applications.

View on arXivView PDF

Code Implementations(1)

muz1lee/MOTdataCommunity100%
MIT

Implementation of FedBary

184Shell, PythonSep 25, 20231 years agoMIT

Similar Papers

Cite this paper

@article{li2024private,
  title  = {Private Wasserstein Distance},
  author = {Wenqian Li and Yan Pang},
  year   = {2024},
  eprint = {2404.06787},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.06787v2}
}

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

Discussion