arXiv Statistics ML

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.

arXiv Machine Learning
Jun 18

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.

By Xiuyuan Cheng, Yunqin Zhu, Yao Xie
arXiv Machine Learning
Oct 28

Active Learning of Conditional Generative Models via the Transport Neural Tangent Kernel

The paper introduces the transport Neural Tangent Kernel (tNTK) to enable active learning for conditional generative models that produce distributional outputs. By decomposing the Wasserstein test risk into mean and shape components, the authors show that mean‑based active learning misses distributional shape, and propose tNTK as a tractable kernel that captures sensitivity of the predicted distribution to model parameters. Using tNTK as a Gaussian process covariance, they greedily select inputs that minimize posterior variance, and demonstrate that this distribution‑aware strategy outperforms mean‑based NTK baselines across several generative model types and datasets.

By Jayoung Ryu, Kyunghyun Cho, Romain Lopez
arXiv Machine Learning
Aug 27

Generative Modeling by Minimizing the Wasserstein-2 Loss

This paper introduces a generative model that minimizes the second‑order Wasserstein loss (W₂) by solving a distribution‑dependent ordinary differential equation (ODE) whose dynamics involve the Kantorovich potential of the true data distribution and its current estimate. The authors prove that the time‑marginal laws of this ODE form a gradient flow for the W₂ loss, converging exponentially to the true data distribution, and propose an Euler scheme that recovers this gradient flow in the limit. An algorithm based on this scheme, combined with persistent training, is shown in experiments to outperform Wasserstein GANs in both low‑ and high‑dimensional settings when the level of persistent training is appropriately increased.

By Yu-Jui Huang, Zachariah Malik
arXiv Machine Learning
Oct 19

Deep conditional distribution learning via conditional F\"ollmer flow

The paper presents Conditional Föllmer Flow, an ODE‑based deep generative approach for learning conditional distributions. Starting from a Gaussian, the flow approximates the target distribution near time 1, with Euler discretization and a neural‑network‑estimated velocity field. The authors prove convergence in Wasserstein‑2 distance and demonstrate superior performance on both nonparametric density estimation and image‑based tasks compared to existing methods.

By Jinyuan Chang, Zhao Ding, Yuling Jiao, Ruoxuan Li, Jerry Zhijian Yang
arXiv Machine Learning
Aug 31

Prequential posteriors

The paper introduces prequential posteriors, a Bayesian approach that uses a predictive‑sequential loss function to update deep generative forecasting models (DGFMs) when new data arrive. By adopting a consistency notion suitable for model misspecification, the authors prove that both the loss minimizer and the posterior concentrate on parameters with optimal predictive performance. Scalable inference is achieved with parallelisable waste‑free sequential Monte Carlo samplers that employ preconditioned gradient kernels, and the method is validated on synthetic and real meteorological time‑series data.

By Shreya Sinha-Roy, Richard G. Everitt, Christian P. Robert, Ritabrata Dutta
arXiv Machine Learning
Oct 9

Barron Optimal Transport I: Generative Modeling

The paper introduces a new optimal transport framework that uses the Barron energy—an intrinsic neural network complexity measure—instead of the traditional kinetic energy. By modeling transport as deep residual networks that map a reference distribution to a target distribution, the authors define a new metric on probability measures and analyze its properties for generative modeling. They demonstrate that diffusion generative models are suboptimal in this Barron geometry and explore how adaptivity can improve alternative generative approaches.

By Evan Dogariu, Joan Bruna
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