Causal optimal transport and its links to enlargement of filtrations and continuous-time stochastic optimization
Not on the map. Why?
Abstract (arXiv)
The martingale part in the semimartingale decomposition of a Brownian motion with respect to an enlargement of its filtration, is an anticipative mapping of the given Brownian motion. In analogy to optimal transport theory, we define causal transport plans in the context of enlargement of filtrations, as the Kantorovich counterparts of the aforementioned non-adapted mappings. We provide a necessary and sufficient condition for a Brownian motion to remain a semimartingale in an enlarged filtration, in terms of certain minimization problems over sets of causal transport plans. The latter are also used in order to give robust transport-based estimates for the value of having additional information, as well as model sensitivity with respect to the reference measure, for the classical stochastic optimization problems of utility maximization and optimal stopping. Our results have natural extensions to the case of general multidimensional continuous semimartingales.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Nov 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 3; 2025: 2; 2026: 1.
11 papers.
- 2022Small Transformers Compute Universal Metric Embeddingscited by 12
- 2024Time-Causal VAE: Robust Financial Time Series Generatorcited by 8
- 2024Neural Spacetimes for DAG Representation Learningcited by 5
- 2021Conditional COT-GAN for Video Prediction with Kernel Smoothingcited by 3
- 2023Unlocking optimal batch size schedules using continuous-time control and perturbation theorycited by 3
- 2023Fitted value iteration methods for bicausal optimal transportcited by 2
- 2022Distributionally robust risk evaluation with a causality constraint and structural informationcited by 1
- 2024Auditing and Enforcing Conditional Fairness via Optimal Transportcited by 1
- 2025Nested Optimal Transport Distancescited by 0
- 2025Wasserstein Distributionally Robust Optimization Through the Lens of Structural Causal Models and Individual Fairnesscited by 0
- 2026PLOT: Progressive Localization via Optimal Transport in Neural Causal Abstractioncited by 0
- 2026PLOT: Progressive Localization via Optimal Transport in Neural Causal Abstraction7 May 2026
- 2025Wasserstein Distributionally Robust Optimization Through the Lens of Structural Causal Models and Individual Fairness30 Sep 2025
- 2025Nested Optimal Transport Distances8 Sep 2025
- 2024Time-Causal VAE: Robust Financial Time Series Generator5 Nov 2024
- 2024Auditing and Enforcing Conditional Fairness via Optimal Transport17 Oct 2024
- 2024Neural Spacetimes for DAG Representation Learning25 Aug 2024
- 2023Unlocking optimal batch size schedules using continuous-time control and perturbation theory4 Dec 2023
- 2023Fitted value iteration methods for bicausal optimal transport22 Jun 2023
- 2022Small Transformers Compute Universal Metric Embeddings14 Sep 2022
- 2022Distributionally robust risk evaluation with a causality constraint and structural information20 Mar 2022
- 2021Conditional COT-GAN for Video Prediction with Kernel Smoothing10 Jun 2021