mlsanityData to 7 Oct 2026

Generative models for decision-making under distributional shift

arXiv 2604.04342 ↗First posted 6 Apr 2026cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

Many data-driven decision problems are formulated using a nominal distribution estimated from historical data, while performance is ultimately determined by a deployment distribution that may be shifted, context-dependent, partially observed, or stress-induced. This tutorial presents modern generative models, particularly flow- and score-based methods, as mathematical tools for constructing decision-relevant distributions. From an operations research perspective, their primary value lies not in unconstrained sample synthesis but in representing and transforming distributions through transport maps, velocity fields, score fields, and guided stochastic dynamics. We present a unified framework based on pushforward maps, continuity, Fokker-Planck equations, Wasserstein geometry, and optimization in probability space. Within this framework, generative models can be used to learn nominal uncertainty, construct stressed or least-favorable distributions for robustness, and produce conditional or posterior distributions under side information and partial observation. We also highlight representative theoretical guarantees, including forward-reverse convergence for iterative flow models, first-order minimax analysis in transport-map space, and error-transfer bounds for posterior sampling with generative priors. The tutorial provides a principled introduction to using generative models for scenario generation, robust decision-making, uncertainty quantification, and related problems under distributional shift.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 51 of its 71 references that are in the map. First posted on arXiv 6 Apr 2026.

Builds on

51 of 71 references.

References · 51

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020Denoising Diffusion Probabilistic Modelscited by 20,851
  3. 2020Denoising Diffusion Implicit Modelscited by 9,655
  4. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  5. 2022Classifier-Free Diffusion Guidancecited by 5,717
  6. 2022Flow Matching for Generative Modelingcited by 5,426
  7. 2016Image-to-Image Translation with Conditional Adversarial Networkscited by 4,510
  8. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  9. 2018Neural Ordinary Differential Equationscited by 3,733
  10. 2017Improved Training of Wasserstein GANscited by 2,223
  11. 2016Density estimation using Real NVPcited by 2,029
  12. 2023Consistency Modelscited by 1,778
38 more
  1. 2018Glow: Generative Flow with Invertible 1x1 Convolutionscited by 1,539
  2. 2022Diffusion Posterior Sampling for General Noisy Inverse Problemscited by 1,375
  3. 2014NICE: Non-linear Independent Components Estimationcited by 1,052
  4. 2019An Introduction to Variational Autoencoderscited by 997
  5. 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
  6. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 897
  7. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 584
  8. 2021Solving Inverse Problems in Medical Imaging with Score-Based Generative Modelscited by 514
  9. 2018Invertible Residual Networkscited by 364
  10. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
  11. 2024Flow Matching Guide and Codecited by 291
  12. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  13. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  14. 2022Rectified Flow: A Marginal Preserving Approach to Optimal Transportcited by 277
  15. 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 266
  16. 2018Analyzing Inverse Problems with Invertible Neural Networkscited by 239
  17. 2019Optimal transport mapping via input convex neural networkscited by 202
  18. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  19. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
  20. 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
  21. 2018Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problemcited by 123
  22. 2019A Machine Learning Framework for Solving High-Dimensional Mean Field Game and Mean Field Control Problemscited by 95
  23. 2018Sliced-Wasserstein Flows: Nonparametric Generative Modeling via Optimal Transport and Diffusionscited by 77
  24. 2021Large-Scale Wasserstein Gradient Flowscited by 76
  25. 2018Conditional Density Estimation with Bayesian Normalising Flowscited by 54
  26. 2021Variational Wasserstein gradient flowcited by 53
  27. 2023Provable Probabilistic Imaging using Score-Based Generative Priorscited by 51
  28. 2021Faster Single-loop Algorithms for Minimax Optimization without Strong Concavitycited by 47
  29. 2022Normalizing flow neural networks by JKO schemecited by 39
  30. 2023Convergence of flow-based generative models via proximal gradient descent in Wasserstein spacecited by 34
  31. 2023Flow-based Distributionally Robust Optimizationcited by 13
  32. 2021Signatured Deep Fictitious Play for Mean Field Games with Common Noisecited by 12
  33. 2023Computing high-dimensional optimal transport by flow neural networkscited by 8
  34. 2024Distributionally Robust Optimization via Iterative Algorithms in Continuous Probability Spacescited by 8
  35. 2025Worst-case generation via minimax optimization in Wasserstein spacecited by 7
  36. 2022Invertible Neural Networks for Graph Predictioncited by 6
  37. 2024Posterior sampling via Langevin dynamics based on generative priorscited by 5
  38. 2025High-dimensional Mean-Field Games by Particle-based Flow Matchingcited by 3

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.