Entropic adapted Wasserstein distance on Gaussians
Not on the map. Why?
Abstract (arXiv)
The adapted Wasserstein distance is a metric for quantifying distributional uncertainty and assessing the sensitivity of stochastic optimization problems on time series data. A computationally efficient alternative to it, is provided by the entropically regularized adapted Wasserstein distance. Suffering from similar shortcomings as classical optimal transport, there are only few explicitly known solutions to those distances. Recently, Gunasingam--Wong provided a closed-form representation of the adapted Wasserstein distance between real-valued stochastic processes with Gaussian laws. In this paper, we extend their work in two directions, by considering multidimensional (ℝd-valued) stochastic processes with Gaussian laws and including the entropic regularization. In both settings, we provide closed-form solutions.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Dec 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
- 2025Nested Optimal Transport Distancescited by 0
- 2026Causal Optimal Coupling for Gaussian Input-Output Distributional Datacited by 0
- 2026Causal Optimal Coupling for Gaussian Input-Output Distributional Data1 Apr 2026
- 2025Nested Optimal Transport Distances8 Sep 2025