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.
Advances in Neural Information Processing Systems 30(2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
method 1polarities
use method 1representative citing papers
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.