arXiv Statistics ML
Financial Tail Risk Beyond Lipschitz Continuity via Semi-Discrete Optimal Transport
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
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.
arXiv AI
Jun 4
Markov Chain Decoders Overcome the Heavy-Tail Limitations of Lipschitz Generative Models
arXiv:2605. 18931v2 Announce Type: replace-cross Abstract: Heavy-tailed distributions are prevalent in performance evaluation, network traffic, and risk modeling.
arXiv Machine Learning
Jun 30
Heads, Not Backbones: Output Heads Dominate Architectures on Fat-Tailed Returns
arXiv:2606. 30037v1 Announce Type: new Abstract: In a deep forecasting pipeline for fat-tailed financial returns at short horizons, which matters more - the backbone architecture or the output head?
arXiv Machine Learning
Aug 3
Conditioning Tree-Based Diffusions and Flows for Probabilistic Tabular Regression
arXiv:2607. 28864v1 Announce Type: cross Abstract: Tree-based diffusion models fit flexible conditional predictive distributions for tabular regression without a neural density estimator, but they inherit their design defaults---noising path, parameterization, training distribution, features, sampler---from the neural setting.
arXiv Statistics ML
5d ago
Brenier Meets Adversarial Training: Optimal Transport Geometry for Robust Learning
The paper introduces a penalized distributionally robust optimization framework that allows an adversary to choose any distribution while incurring a Wasserstein penalty for deviating from the empirical distribution. It shows that the adversary’s problem can be reformulated as optimizing transport maps that push empirical samples to adversarial ones, proving that optimal maps are cyclically monotone. The authors argue that standard per-sample adversarial training violates this property and propose two remedies—multi-start particle ascent and input-convex neural network parameterization—to enforce cyclical monotonicity, demonstrating improved robustness and generalization in experiments on regression, image classification, and control tasks.
arXiv Machine Learning
Jul 16
Heavy-Tailed Flow Matching via Random Clocks
arXiv:2607. 13841v1 Announce Type: new Abstract: Heavy-tailed data arise in many domains where rare events carry disproportionate importance, such as imbalanced image datasets, financial returns, and weather extremes.