Transport-Coupled Bayesian Flows for Molecular Graph Generation (TopBF) addresses a key mismatch in existing diffusion models for molecular graph generation by eliminating the need for hard discretization during sampling. The framework generates graphs directly in continuous parameter distributions, learns graph topology via a Quasi-Wasserstein optimal‑transport coupling with geodesic costs, and enables property‑conditioned generation without retraining. Experiments on QM9 and ZINC250k show that TopBF achieves higher structural fidelity and more efficient generation compared to prior methods.
arXiv:2603. 23398v3 Announce Type: replace-cross Abstract: Generative modeling of discrete data, such as graphs, underpins many scientific and industrial applications, including molecular discovery and materials design.
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.
arXiv:2606. 01595v1 Announce Type: new Abstract: Bayesian inference provides a principled framework for modeling epistemic uncertainty in neural networks by treating predictions as distributions rather than deterministic values.
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.
arXiv:2512. 18454v3 Announce Type: replace Abstract: Predictive machine learning models generally excel on in-distribution data, but their performance degrades on out-of-distribution (OOD) inputs.
arXiv:2607. 09277v1 Announce Type: new Abstract: Three-dimensional (3D) molecule generation has been dominated by diffusion models, which achieve strong generation quality but typically require the molecular size to be specified a priori.
arXiv:2605. 15354v2 Announce Type: replace Abstract: Despite the success of foundation models in language and vision, molecular graph generation still lacks a unified framework for heterogeneous design tasks with reliable controllability.
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.
arXiv:2603. 10395v2 Announce Type: replace Abstract: Graph generation is a fundamental task with broad applications, such as drug discovery.
arXiv:2607. 19519v1 Announce Type: cross Abstract: Most 3D properties relevant to molecular design, including free energies and shape descriptors, are $\textit{expectations}$ over the Boltzmann distribution over 3D configurations of a molecular graph.
arXiv:2606. 07239v1 Announce Type: new Abstract: The success of generative molecular design hinges on a model's steerability toward high-reward samples.
arXiv:2607. 05736v1 Announce Type: new Abstract: Molecular property prediction often relies on isolated data modalities, where continuous 3D graph neural networks (GNNs) struggle to efficiently capture long-range topological dependencies and exact macroscopic heuristics.