Introduces Wasserstein-on-Wasserstein flow matching that realizes metameasure flows via nested Wasserstein geometry and scalable sliced/linear approximations for generative modeling of transport plans.
arXiv preprint arXiv:2509.03506 (2025)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Adapted optimal transport on filtered Gaussian processes reduces to a constrained Procrustes problem between Cholesky factors, yielding explicit martingale projections and asymptotic equivalence among bicausal couplings.
citing papers explorer
-
Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once
Introduces Wasserstein-on-Wasserstein flow matching that realizes metameasure flows via nested Wasserstein geometry and scalable sliced/linear approximations for generative modeling of transport plans.
-
Adapted Optimal Transport between Filtered Gaussian Processes
Adapted optimal transport on filtered Gaussian processes reduces to a constrained Procrustes problem between Cholesky factors, yielding explicit martingale projections and asymptotic equivalence among bicausal couplings.