Fine-Tuning Generative Models for Extreme Events via CVaR-Penalized Wasserstein Gradient Flows
Not on the map. Why?
Abstract (arXiv)
In many high-stakes domains, extreme events carry substantial consequences, yet learning the heavy-tailed distributions that govern them from finite samples remains challenging: the quantities of interest are driven by a few extreme observations, so the tail is under-sampled relative to its importance. Even generative models tailored for heavy tails capture the tail region inadequately in practice. We propose the Conditional Value-at-Risk (CVaR)-penalized Generative Particle Algorithm (CVaR-GPA), a tail-agnostic algorithm for fine-tuning generative models toward heavy-tailed targets, built as a time discretization of the Wasserstein gradient flow of the Lipschitz-regularized KL divergence penalized by a CVaR discrepancy term. Such a flow can be initialized from the output samples of the pre-trained model, which are then transported along the gradient descent of the loss functional, without requiring access to the pre-trained model's internal architecture. The Lipschitz-regularized KL divergence requires minimal assumptions on the target, while the CVaR penalty focuses the flow on the tail. The CVaR penalty depends on the target only through a scalar tail statistic, inducing a velocity field that remains active in the under-sampled tail region at a dimension-free estimation cost. The resulting velocity field, and hence the depth of the transport map, implicitly adapts to the target, without target-specific modifications. Across four targets, including two real-world, high-dimensional datasets (daily streamflow in the Ohio River basin (d=64) and the Fama-French portfolios (d=25) with tail indices ranging from 1.05 to 3.34), fine-tuning with CVaR-GPA reduces global and tail errors by geometric-mean factors of 14.0 × and 9.8 ×, respectively, across seven pre-trained models spanning GANs, diffusion models, and other generative flows, with a single set of hyperparameters.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 34 references that are in the map. First posted on arXiv 12 Aug 2026.
Builds on
14 of 34 references.
References · 14
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2024Heavy-Tailed Diffusion Modelscited by 34
- 2020ExGAN: Adversarial Generation of Extreme Samplescited by 28
- 2021Pareto GAN: Extending the Representational Power of GANs to Heavy-Tailed Distributionscited by 22
- 2025Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuningcited by 15
- 2019Formulation and properties of a divergence used to compare probability measures without absolute continuitycited by 11
- 2024Flexible Tails for Normalizing Flowscited by 11
- 2020(f,Gamma)-Divergences: Interpolating between f-Divergences and Integral Probability Metricscited by 10
- 2022Lipschitz-regularized gradient flows and generative particle algorithms for high-dimensional scarce datacited by 8
- 2025Mirror Flow Matching with Heavy-Tailed Priors for Generative Modeling on Convex Domainscited by 8
- 2025Risk-Averse Finetuning of Large Language Modelscited by 7
- 2026Efficient Tail-Aware Generative Optimization via Flow Model Fine-Tuningcited by 6
Built on by
Not cited yet.