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:2605. 18931v2 Announce Type: replace-cross Abstract: Heavy-tailed distributions are prevalent in performance evaluation, network traffic, and risk modeling.
By Abdelhakim Ziani, Andras Horvath, Paolo Ballarini
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:2610.35490v1 Announce Type: cross
Abstract: We study minimax rates for conditional generative learning under integrated Wasserstein loss, with H\"older continuous conditional laws and an unrest...
By Sungwon Park, Kyoung-Sook Moon, Hongjoong Kim
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:2610.01034v1 Announce Type: cross
Abstract: Bayesian inference increasingly uses informative but implicit priors represented only by samples, such as historical ensembles, simulator outputs, an...
By Hoang Phuc Hau Luu, Marcelo Hartmann, Zhongjian Wang
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
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
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:2606. 10023v1 Announce Type: cross Abstract: Accurate posterior estimation is central to scientific inference, as uncertainties determine what can be reliably learned from observational data.
By Ludvig Doeser, Jens Jasche
arXiv:2607. 04360v1 Announce Type: cross Abstract: Conditional generative models have emerged as powerful tools for sampling from target conditional distributions, driving substantial advances across a wide range of scientific and applied domains.
By Shijin Gong, Baihua He, Xinyu Zhang
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