← Back to all news
arXiv Machine Learning

Alignment Matters Inside and Out in Equivariant Graph Flow Matching

The paper investigates how alignment—both outer (choosing which graphs to pair) and inner (aligning node representatives)—affects permutation-equivariant graph flow matching. It connects inner alignment to transport on the graph quotient space and shows that quotient couplings can be lifted to aligned representatives, while symmetrization yields equivariant flow‑matching minimizers. Experiments on continuous graph and molecular generation demonstrate that appropriate alignment can simplify trajectories and improve few‑step generation, though the benefits vary with the type of alignment and computational budget.

Related stories

arXiv Machine Learning
Aug 28

Gromov-Monge Flow Matching for Equivariant Graph Generation

The paper introduces Gromov-Monge Flow Matching, a method that incorporates permutation-equivariance into generative graph models by aligning graph pairs up to node relabeling using the Gromov–Monge distance. It shows theoretically that quotient couplings can be lifted to aligned representatives without extra cost and that symmetrization yields equivariant flow-matching minimizers, even for categorical endpoints. Practically, the authors build minibatch couplings with Gromov–Wasserstein relaxations and optional outer assignments, improving sample quality in continuous graph and categorical molecular generation while remaining compatible with standard equivariant architectures.

By Moritz Piening, Christian Wald
diffusionsafety
More like this →
arXiv Machine Learning
Sep 7

Embedded Graph Flows for Categorical Graph Generation

Embedded Graph Flows (EGF) is a generative model for categorical graphs that learns continuous embeddings for node and unordered-edge categories and uses a permutation‑equivariant graph transformer to transport Gaussian noise toward these embeddings. A terminal readout then maps the embeddings back to discrete graph categories. EGF achieves competitive performance on molecular benchmarks, outperforming other methods on QM9 and maintaining low maximum mean discrepancy on ZINC250k.

By Ethan Ma, Zihan Wang, Chris Siu Yeung Chow, Xinguo Feng, Qingqing Li, Rui Jiang, Naipeng Dong, Guangdong Bai
llmsragdiffusionbenchmarks
More like this →
arXiv Machine Learning
Jul 22

GEqTrain: A Configuration-Driven Framework for Retargeting Equivariant Graph Neural Networks Across 3D Scientific Tasks

arXiv:2607. 19083v1 Announce Type: new Abstract: Equivariant graph neural networks provide a powerful modeling language for three-dimensional scientific data, but their reuse is often limited by implementations tied to specific tasks, outputs, and training regimes.

By Daniele Angioletti, Marco Nobile, Vittorio Limongelli
diffusionbenchmarks
More like this →
arXiv Machine Learning
Sep 24

Variational Bayesian Flow Network for Graph Generation

The paper introduces Variational Bayesian Flow Network (VBFN), a graph generation model that lifts Bayesian updates to a joint Gaussian belief family with structured precisions, enabling coupled node and edge updates in a single fusion step. By constructing sample‑agnostic sparse precisions from a representation‑induced dependency graph, VBFN avoids label leakage while enforcing node‑edge consistency. Experiments on synthetic and molecular graph datasets show that VBFN improves fidelity and diversity over baseline methods.

By Yida Xiong, Jiameng Chen, Xiuwen Gong, Jia Wu, Shirui Pan, Wenbin Hu
diffusion
More like this →