Generative Conditional Distributions by Neural (Entropic) Optimal Transport
Not on the map. Why?
Abstract (arXiv)
Learning conditional distributions is challenging because the desired outcome is not a single distribution but multiple distributions that correspond to multiple instances of the covariates. We introduce a novel neural entropic optimal transport method designed to effectively learn generative models of conditional distributions, particularly in scenarios characterized by limited sample sizes. Our method relies on the minimax training of two neural networks: a generative network parametrizing the inverse cumulative distribution functions of the conditional distributions and another network parametrizing the conditional Kantorovich potential. To prevent overfitting, we regularize the objective function by penalizing the Lipschitz constant of the network output. Our experiments on real-world datasets show the effectiveness of our algorithm compared to state-of-the-art conditional distribution learning techniques. Our implementation can be found at https://github.com/nguyenngocbaocmt02/GENTLE.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 4 Jun 2024.
Builds on
24 of 46 references.
References · 24
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2013A survey of the Schr"odinger problem and some of its connections with optimal transportcited by 292
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 270
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
- 2022Neural Optimal Transportcited by 126
- 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertaintycited by 82
- 2022Supervised Training of Conditional Monge Mapscited by 61
- 2022Conditional Simulation Using Diffusion Schr"odinger Bridgescited by 60
- 2022Entropic Neural Optimal Transport via Diffusion Processescited by 50
- 2020Conditional Sampling with Monotone GANs: from Generative Models to Likelihood-Free Inferencecited by 42
12 more
- 2023Generative Modeling through the Semi-dual Formulation of Unbalanced Optimal Transportcited by 41
- 2019Using Wasserstein Generative Adversarial Networks for the Design of Monte Carlo Simulationscited by 32
- 2023Can You Rely on Your Model Evaluation? Improving Model Evaluation with Synthetic Test Datacited by 32
- 2022Validating Causal Inference Methodscited by 20
- 2020Distributionally robust stochastic programs with side information based on trimmings -- Extended versioncited by 19
- 2021Smooth p-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applicationscited by 15
- 2020Distributionally Robust Local Non-parametric Conditional Estimationcited by 13
- 2021Robustifying Conditional Portfolio Decisions via Optimal Transportcited by 12
- 2022Universal Gradient Descent Ascent Method for Nonconvex-Nonconcave Minimax Optimizationcited by 12
- 2017Ranking and Selection with Covariates for Personalized Decision Makingcited by 10
- 2020Distributionally Robust Parametric Maximum Likelihood Estimationcited by 3
- 2023Learning to Simulate: Generative Metamodeling via Quantile Regressioncited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.