arXiv Machine Learning
techCenter
Gromov-Monge Flow Matching for Equivariant Graph Generationtranslating…
1 min readUnknownarXiv Digital Media
arXiv:2608.26961v1 Announce Type: new
Abstract: Graphs are invariant under node permutations, motivating the use of permutation-equivariant architectures in generative models. In flow matching, however, symmetry may also enter the source--target coupling: once graph pairs are…