Improving Molecular Graph Generation with Flow Matching and Optimal Transport

2024-11-08 · Xiaoyang Hou, Tian Zhu, Milong Ren, Dongbo Bu, Xin Gao, Chunming Zhang, Shiwei Sun

Generating molecular graphs is crucial in drug design and discovery but remains challenging due to the complex interdependencies between nodes and edges. While diffusion models have demonstrated their potentiality in molecular graph design, they often suffer from unstable training and inefficient sampling. To enhance generation performance and training stability, we propose GGFlow, a discrete flow matching generative model incorporating optimal transport for molecular graphs and it incorporates an edge-augmented graph transformer to enable the direct communications among chemical bounds. Additionally, GGFlow introduces a novel goal-guided generation framework to control the generative trajectory of our model, aiming to design novel molecular structures with the desired properties. GGFlow demonstrates superior performance on both unconditional and conditional molecule generation tasks, outperforming existing baselines and underscoring its effectiveness and potential for wider application.

📄 PDF Abstract BibTeX arXiv:2411.05676

Code (0)

등록된 구현이 없습니다.

Tasks

Drug DesignGraph GenerationMolecular Graph Generation

Methods 이 논문이 사용한 방법론

Attention 설명 없음

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.

Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…

Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…

Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…

LapEigen 설명 없음

Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…

Position-Wise Feed-Forward Layer 설명 없음

Efficient Molecular Conformer Generation with SO(3)-Averaged Flow Matching and Reflow

2025-07-13 · Zhonglin Cao, Mario Geiger, Allan dos Santos Costa, Danny Reidenbach 외 arxiv

Fast and accurate generation of molecular conformers is desired for downstream computational chemistry and drug discovery tasks. Currently, training and sampling state-of-the-art diffusion or flow-based models for confor…

Drug Discovery

Gromov-Monge Flow Matching for Equivariant Graph Generation

2026-08-27 · Moritz Piening, Christian Wald arxiv

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 p…

Graph Generation

Variational Flow Matching for Graph Generation

2024-06-07 · Floor Eijkelboom, Grigory Bartosh, Christian Andersson Naesseth, Max Welling 외

We present a formulation of flow matching as variational inference, which we refer to as variational flow matching (VFM). Based on this formulation we develop CatFlow, a flow matching method for categorical data. CatFlow…

Graph Generation Variational Inference

Flowette: Flow Matching with Graphette Priors for Graph Generation

2026-02-27 · Asiri Wijesinghe, Sevvandi Kandanaarachchi, Daniel M. Steinberg, Cheng Soon Ong arxiv

We study generative modeling of graphs with recurring subgraph motifs. We propose Flowette, a continuous flow matching framework that employs a graph neural network-based transformer to learn a velocity field over graph …

Graph Neural Network Graph Generation

FlowMS: Flow Matching for De Novo Structure Elucidation from Mass Spectra

2026-03-19 · Jianan Nie, Peng Gao arxiv

Mass spectrometry (MS) stands as a cornerstone analytical technique for molecular identification, yet de novo structure elucidation from spectra remains challenging due to the combinatorial complexity of chemical space a…