mlsanityData to 14 Oct 2026

Robust Optimization in Causal Models and G-Causal Normalizing Flows

arXiv 2510.15458 ↗First posted 17 Oct 2025stat.ML cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 22 references that are in the map. First posted on arXiv 17 Oct 2025.

Builds on

7 of 22 references.

References · 7

  1. 2023A Brief Review of Hypernetworks in Deep Learningcited by 102
  2. 2020COT-GAN: Generating Sequential Data via Causal Optimal Transportcited by 71
  3. 2023A Survey on Causal Discovery: Theory and Practicecited by 63
  4. 2021Distributionally Robust Learningcited by 44
  5. 2021Quantitative Stability of Regularized Optimal Transport and Convergence of Sinkhorn's Algorithmcited by 22
  6. 2022Computational methods for adapted optimal transportcited by 12
  7. 2023Optimal transport and Wasserstein distances for causal modelscited by 9

Built on by

Not cited yet.