paper-with-me

Papers

Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matching

2024-03-27 · Jannis Chemseddine, Paul Hagemann, Gabriele Steidl, Christian Wald

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.

📄 PDF Abstract BibTeX arXiv:2403.18705

Code (1)

jchemseddine/conditional_wasserstein_distances 공식 구현 pytorch

Tasks

Conditional Image GenerationImage Generation

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Similar Papers 제목 키워드 기반

Flow Matching: Markov Kernels, Stochastic Processes and Transport Plans

2025-01-28 · Christian Wald, Gabriele Steidl

Among generative neural models, flow matching techniques stand out for their simple applicability and good scaling properties. Here, velocity fields of curves connecting a simple latent and a target distribution are lear…

Sliced-Wasserstein Distances and Flows on Cartan-Hadamard Manifolds

2024-03-11 · Clément Bonet, Lucas Drumetz, Nicolas Courty

While many Machine Learning methods were developed or transposed on Riemannian manifolds to tackle data with known non Euclidean geometry, Optimal Transport (OT) methods on such spaces have not received much attention. T…

Generalized Sliced Wasserstein Distances

2019-02-01 · NeurIPS 2019 12 · Soheil Kolouri, Kimia Nadjahi, Umut Simsekli, Roland Badeau 외

The Wasserstein distance and its variations, e.g., the sliced-Wasserstein (SW) distance, have recently drawn attention from the machine learning community. The SW distance, specifically, was shown to have similar propert…

$L^2$ over Wasserstein: Statistical Analysis for Optimal Transport

2026-05-20 · Riccardo Passeggeri, Rohan M. Shenoy, Pengcheng Ye arxiv

Optimal transport provides an inherently geometric and highly structured framework for studying spaces of probability measures, supplying a rich theoretical toolkit for contemporary statistics, machine learning, and gene…

Paired Wasserstein Autoencoders for Conditional Sampling

2024-12-10 · Moritz Piening, Matthias Chung

Wasserstein distances greatly influenced and coined various types of generative neural network models. Wasserstein autoencoders are particularly notable for their mathematical simplicity and straight-forward implementati…

DenoisingTranslation