1 citations · 1 across the 11 of their papers we have counts for
Showing 2026 · cs.LGShow all
2 papers · 2 filters
cs.LG2026
Gromov-Monge Flow Matching for Equivariant Graph Generation
Moritz Piening, Christian Wald
Graphs are invariant under node permutations, motivating the use of permutation-equivariant architectures in generative models. In flow matching, however, symmetry may also enter t…
cs.LG2026
Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once
Moritz Piening, Richard Duong, Gabriele Steidl
Flow matching has recently emerged as a flexible and efficient framework for generative modelling by learning deterministic transport dynamics between probability measures. In this…