Adapted Optimal Transport between Filtered Gaussian Processes
Madhu Gunasingam, Ting-Kam Leonard Wong

TL;DR
This paper advances the understanding of adapted optimal transport for Gaussian processes, introducing a new space, variational representations, and analyzing asymptotic behaviors of transport costs.
Contribution
It introduces a space of filtered Gaussian processes driven by Gaussian white noise, characterizes the adapted Wasserstein distance, and analyzes asymptotic transport costs.
Findings
The adapted Wasserstein distance admits a variational representation as a constrained orthogonal Procrustes problem.
Transport costs of Gaussian bicausal couplings are asymptotically equivalent as time horizon grows.
The classical Bures--Wasserstein distance is strictly smaller than the adapted transport costs.
Abstract
We continue the study of adapted optimal transport in the discrete-time Gaussian setting. To this end, we introduce a space of filtered Gaussian processes where both the randomness and the flow of information are driven by a Gaussian white noise. On this space, the adapted -Wasserstein distance () admits a variational representation as a constrained orthogonal Procrustes problem between Cholesky factors. Furthermore, the resulting quotient space is the -completion of the space of Gaussian distributions on the path space. We also characterize explicitly the -projections onto the subspaces of Gaussian martingales. Next, we analyze the adapted Brenier coupling -- a multivariate generalization of the Knothe--Rosenblatt coupling that serves as a myopic solution to the adapted transport problem, and compute its transport cost. Utilizing a Gaussian random matrix…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
