Paper: arXiv 2510.15458

Authors: Gabriele Visentin, Patrick Cheridito

Abstract

In this paper, we show that interventionally robust optimization problems in causal models are continuous under the $G$-causal Wasserstein distance, but may be discontinuous under the standard Wasserstein distance. This highlights the importance of using generative models that respect the causal structure when augmenting data for such tasks. To this end, we propose a new normalizing flow architecture that satisfies a universal approximation property for causal structural models and can be efficiently trained to minimize the $G$-causal Wasserstein distance. Empirically, we demonstrate that our model outperforms standard (non-causal) generative models in data augmentation for causal regression and mean-variance portfolio optimization in causal factor models.

Complexity vs Empirical Score

  • Math Complexity: 9.5/10
  • Empirical Rigor: 6.0/10
  • Quadrant: Holy Grail — high math complexity, high empirical rigor

Why this score: The paper is heavily theoretical with dense mathematical proofs (e.g., continuity under G-causal Wasserstein distance, universal approximation properties), warranting a high math score. It provides empirical validation in finance (causal regression, portfolio optimization) with clear comparisons to baselines, but the implementation details and data specifics are less emphasized than the theoretical framework.

Research Flowchart

  flowchart TD
  A["Research Goal:<br>Robust Optimization in Causal Models"] --> B["Key Methodology:<br>Interventionally Robust Optimization<br>via G-Causal Wasserstein Distance"]
  B --> C["Computational Process:<br>Proposed G-Causal Normalizing Flow<br>for Efficient Training"]
  C --> D["Data Input:<br>Causal Factor Models &<br>Interventional Data"]
  D --> E["Comparative Analysis:<br>Standard vs. Causal<br>Generative Models"]
  E --> F["Key Findings:<br>1. Robustness continuous under G-Causal Wasserstein<br>2. Outperforms non-causal models in<br>causal regression & portfolio optimization"]

Cited References (34)

  1. Scaling Learning Algorithms Towards AI (2007)
  2. A Fast Learning Algorithm for Deep Belief Nets (2006)
  3. Deep learning (2016)
  4. Time-Causal VAE: Robust Financial Time Series Generator — → 2411.02947
  5. Set-Valued Analysis (2009)
  6. Adapted Wasserstein distances and stability in mathematical finance (2020)
  7. The probability of backtest overfitting (2017)
  8. Measure theory (2007)
and 26 more
  1. Triangular transformations of measures (2005)
  2. A brief review of hypernetworks in deep learning (2024)
  3. Distributionally robust learning (2020)
  4. A comprehensive survey for generative data augmentation (2024)
  5. Optimal transport and Wasserstein distances for causal models (2025)
  6. Computational methods for adapted optimal transport (2024)
  7. Quantitative stability of regularized optimal transport and convergence of sinkhorn’s algorithm (2022)
  8. Real Analysis: Modern Techniques and their Applications (1999)
  9. Neural autoregressive flows (2018)
  10. Probability Essentials (2004)
  11. Distributionally robust optimization (2025)
  12. Graphical Models (1996)
  13. Multilayer feedforward networks with a nonpolynomial activation function can approximate any function (1993)
  14. Quantitative Risk Management: Concepts, Techniques and Tools (Revised Edition) (2015)
  15. Methods and tools for causal discovery and causal inference (2022)
  16. Elements of Causal Inference: Foundations and Learning Algorithms (2017)
  17. Restricted Structural Equation Models for Causal Inference (2012)
  18. A distance for multistage stochastic optimization models (2012)
  19. Multistage Stochastic Optimization (2014)
  20. Variational Analysis (1998)
  21. Invariant Models for Causal Transfer Learning (2018)
  22. Spline Functions: Basic Theory (2007)
  23. Lectures on Stochastic Programming: Modeling and Theory (2021)
  24. Cot-gan: Generating sequential data via causal optimal transport (2020)
  25. A survey on causal discovery: theory and practice (2022)
  26. Toward understanding generative data augmentation (2023)

1 of 34 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2518 linked papers.