Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching

Jannis Chemseddine, Paul Hagemann, Gabriele Steidl, Christian Wald
3/27/2024
cs.LGmath.OC

No official code found. Best implementation: JChemseddine/Conditional_Wasserstein_Distances (9 stars, last commit 2025-06-04).

Abstract

In inverse problems, many conditional generative models approximate the posterior measure by minimizing a distance between the joint measure and its learned approximation. While this approach also controls the distance between the posterior measures in the case of the Kullback--Leibler divergence, this is in general not hold true for the Wasserstein distance. In this paper, we introduce a conditional Wasserstein distance via a set of restricted couplings that equals the expected Wasserstein distance of the posteriors. Interestingly, the dual formulation of the conditional Wasserstein-1 flow resembles losses in the conditional Wasserstein GAN literature in a quite natural way. We derive theoretical properties of the conditional Wasserstein distance, characterize the corresponding geodesics and velocity fields as well as the flow ODEs. Subsequently, we propose to approximate the velocity fields by relaxing the conditional Wasserstein distance. Based on this, we propose an extension of OT Flow Matching for solving Bayesian inverse problems and demonstrate its numerical advantages on an inverse problem and class-conditional image generation.

View on arXivView PDF

Code Implementations(1)

Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching

90PythonApr 8, 20241 years ago

Similar Papers

Cite this paper

@article{chemseddine2024conditional,
  title  = {Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching},
  author = {Jannis Chemseddine and Paul Hagemann and Gabriele Steidl and Christian Wald},
  year   = {2024},
  eprint = {2403.18705},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.18705v3}
}

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

Discussion