arXiv Machine Learning

Generative models for decision-making under distributional shift

arXiv:2604. 04342v2 Announce Type: replace Abstract: 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.

arXiv Machine Learning
Jun 30

Robustness and Structure Preservation in Flow-Based Generative Models via Wasserstein Path-Space Divergences

arXiv:2410. 01244v2 Announce Type: replace-cross Abstract: We introduce a novel Wasserstein-1 ($W_1$) path-space divergence for stochastic and deterministic dynamics and establish a Wasserstein Uncertainty Propagation (WUP) theorem that bounds the $W_1$ distance between terminal distributions by the proposed divergence, equivalently characterized by a weighted $L^2$ discrepancy between the underlying drifts and the $W_1$ distance between their initial measures.

By Ziyu Chen, Markos A. Katsoulakis, Benjamin J. Zhang
Hugging Face Trending Papers
Jun 29

The Fundamental Limits of Valid Transport Map Estimation

Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map. In applications like generative modeling, the transport cost itself is irrelevant, and this makes it natural to target maps which are more tractable from either a statistical or computational standpoint.

arXiv Machine Learning
Aug 13

Fine-Tuning Generative Models for Extreme Events via CVaR-Penalized Wasserstein Gradient Flows

arXiv:2608. 11544v1 Announce Type: cross Abstract: We propose CVaR-penalized Generative Particle Algorithm (CVaR-GPA), a robust, tail-agnostic algorithm for fine-tuning generative models to learn heavy-tailed distributions and capture extreme events, requiring no prior knowledge or estimation of the target's tail characteristics.

By Thejani Gamage, Hyemin Gu, Zhizhen Zhang, Ziyu Chen, Markos Katsoulakis, Luc Rey-Bellet
arXiv Statistics ML
Aug 28

On the approximation of posterior laws in compound loss models by conditional Wasserstein GANs

The paper introduces a conditional Wasserstein GAN to approximate posterior distributions in compound loss models, conditioning on sufficient statistics, prior mean, coefficient of variation, and mixture weights. A single generator can learn the posteriors for both Poisson intensity and Pareto shape parameters across Gamma, inverse‑Gaussian, and lognormal priors. The authors validate the approach with simulation‑based calibration, analytical comparisons, and extensive MCMC, and apply it to extreme natural catastrophe loss data to generate rolling one‑year posterior predictive distributions and assess tail risk under heavy‑tailed severity and prior uncertainty.

By Aleksandar Arandjelovic, Pavel V. Shevchenko, George Tzougas
arXiv AI
Jul 29

Generative Distributionally Robust Optimization

arXiv:2607. 24983v1 Announce Type: cross Abstract: Generative models are increasingly adopted in distributionally robust optimization (DRO), but existing approaches trade off model compatibility and adversarial structure: methods that accept arbitrary samplers do not restrict worst-case laws to a generator family, while generator-parameterized adversaries rely on model-specific access such as likelihoods, scores, or training data.

By Ziwei Zhang, Jonathan Yu-Meng Li, Zhihao Jin