Y-Diagonal Couplings: Approximating Posteriors with Conditional Wasserstein Distances
Not on the map. Why?
Abstract (arXiv)
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, it does not hold true for the Wasserstein distance. We will introduce a conditional Wasserstein distance with a set of restricted couplings that equals the expected Wasserstein distance of the posteriors. By deriving its dual, we find a rigorous way to motivate the loss of conditional Wasserstein GANs. We outline conditions under which the vanilla and the conditional Wasserstein distance coincide. Furthermore, we will show numerical examples where training with the conditional Wasserstein distance yields favorable properties for posterior sampling.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 23 of its 40 references that are in the map. First posted on arXiv 20 Oct 2023.
Builds on
23 of 40 references.
References · 23
- 2022Generative Adversarial Networkscited by 5,603
- 2014Conditional Generative Adversarial Netscited by 2,152
- 2017Learning Generative Models with Sinkhorn Divergencescited by 310
- 2019Learning Likelihoods with Conditional Normalizing Flowscited by 170
- 2019Guided Image Generation with Conditional Invertible Neural Networkscited by 147
- 2018Deep Bayesian Inversioncited by 60
- 2022Supervised Training of Conditional Monge Mapscited by 60
- 2021Stochastic Normalizing Flows for Inverse Problems: a Markov Chains Viewpointcited by 32
- 2017Sobolev GANcited by 29
- 2021Benchmarking Invertible Architectures on Inverse Problemscited by 25
- 2023Posterior Sampling Based on Gradient Flows of the MMD with Negative Distance Kernelcited by 25
- 2021Wasserstein Generative Learning of Conditional Distributioncited by 24
11 more
- 2022Collapse by Conditioning: Training Class-conditional GANs with Limited Datacited by 24
- 2021Generalized Normalizing Flows via Markov Chainscited by 23
- 2020Optimal Transport for Conditional Domain Matching and Label Shiftcited by 20
- 2023Nonparametric Generative Modeling with Conditional Sliced-Wasserstein Flowscited by 15
- 2023Conditional Generative Models are Provably Robust: Pointwise Guarantees for Bayesian Inverse Problemscited by 12
- 2019Data Driven Conditional Optimal Transportcited by 8
- 2023Solution of physics-based inverse problems using conditional generative adversarial networks with full gradient penaltycited by 7
- 2023Consistent Optimal Transport with Empirical Conditional Measurescited by 6
- 2023Wasserstein Geodesic Generator for Conditional Distributionscited by 4
- 2021About exchanging expectation and supremum for conditional Wasserstein GANscited by 2
- 2023Data Interpolants -- That's What Discriminators in Higher-order Gradient-regularized GANs Arecited by 2
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.