Improving Molecular Graph Generation with Flow Matching and Optimal Transport

• URL: http://arxiv.org/abs/2411.05676v1
• Date: Fri, 08 Nov 2024 16:27:27 GMT
• Title: Improving Molecular Graph Generation with Flow Matching and Optimal Transport
• Authors: Xiaoyang Hou, Tian Zhu, Milong Ren, Dongbo Bu, Xin Gao, Chunming Zhang, Shiwei Sun,
• Abstract summary: GGFlow is a discrete flow matching generative model incorporating optimal transport for molecular graphs. It incorporates an edge-augmented graph transformer to enable the direct communications among chemical bounds. GGFlow demonstrates superior performance on both unconditional and conditional molecule generation tasks.
• Score: 8.2504828891983
• License:
• Abstract: 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.

Related papers

• Conformation Generation using Transformer Flows [55.2480439325792]
  We present ConfFlow, a flow-based model for conformation generation based on transformer networks. ConfFlow directly samples in the coordinate space without enforcing any explicit physical constraints. ConfFlow improve accuracy by up to $40%$ relative to state-of-the-art learning-based methods.
  arXiv  Detail & Related papers  (2024-11-16T14:42:05Z)
• GraphXForm: Graph transformer for computer-aided molecular design with application to extraction [73.1842164721868]
  We present GraphXForm, a decoder-only graph transformer architecture, which is pretrained on existing compounds and then fine-tuned. We evaluate it on two solvent design tasks for liquid-liquid extraction, showing that it outperforms four state-of-the-art molecular design techniques.
  arXiv  Detail & Related papers  (2024-11-03T19:45:15Z)
• DeFoG: Discrete Flow Matching for Graph Generation [45.037260759871124]
  We propose DeFoG, a novel framework using discrete flow matching for graph generation. DeFoG employs a flow-based approach that features an efficient linear noising process and a flexible denoising process. We show that DeFoG achieves state-of-the-art results on synthetic and molecular datasets.
  arXiv  Detail & Related papers  (2024-10-05T18:52:54Z)
• Aligning Target-Aware Molecule Diffusion Models with Exact Energy Optimization [147.7899503829411]
  AliDiff is a novel framework to align pretrained target diffusion models with preferred functional properties. It can generate molecules with state-of-the-art binding energies with up to -7.07 Avg. Vina Score.
  arXiv  Detail & Related papers  (2024-07-01T06:10:29Z)
• Mixed Continuous and Categorical Flow Matching for 3D De Novo Molecule Generation [0.0]
  Flow matching is a recently proposed generative modeling framework that generalizes diffusion models. We extend the flow matching framework to categorical data by constructing flows that are constrained to exist on a continuous representation of categorical data known as the probability simplex. We find that, in practice, a simpler approach that makes no accommodations for the categorical nature of the data yields equivalent or superior performance.
  arXiv  Detail & Related papers  (2024-04-30T17:37:21Z)
• DecompOpt: Controllable and Decomposed Diffusion Models for Structure-based Molecular Optimization [49.85944390503957]
  DecompOpt is a structure-based molecular optimization method based on a controllable and diffusion model. We show that DecompOpt can efficiently generate molecules with improved properties than strong de novo baselines.
  arXiv  Detail & Related papers  (2024-03-07T02:53:40Z)
• Graph Machine Learning for Design of High-Octane Fuels [47.43758223690195]
  Computer-aided molecular design (CAMD) can identify molecules with desired autoignition properties. We propose a modular graph-ML CAMD framework that integrates generative graph-ML models with graph neural networks and optimization. We experimentally investigate and use to illustrate the need for further auto-ignition training data.
  arXiv  Detail & Related papers  (2022-06-01T16:43:04Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• Molecular Graph Generation via Geometric Scattering [7.796917261490019]
  Graph neural networks (GNNs) have been used extensively for addressing problems in drug design and discovery. We propose a representation-first approach to molecular graph generation. We show that our architecture learns meaningful representations of drug datasets and provides a platform for goal-directed drug synthesis.
  arXiv  Detail & Related papers  (2021-10-12T18:00:23Z)
• Learning Attributed Graph Representations with Communicative Message Passing Transformer [3.812358821429274]
  We propose a Communicative Message Passing Transformer (CoMPT) neural network to improve the molecular graph representation. Unlike the previous transformer-style GNNs that treat molecules as fully connected graphs, we introduce a message diffusion mechanism to leverage the graph connectivity inductive bias.
  arXiv  Detail & Related papers  (2021-07-19T11:58:32Z)
• MoFlow: An Invertible Flow Model for Generating Molecular Graphs [19.829612234339578]
  MoFlow is a flow-based graph generative model to learn invertible mappings between molecular graphs and latent representations. Our model has merits including exact and tractable likelihood training, efficient one-pass embedding and generation, chemical validity guarantees, 100% reconstruction of training data, and good generalization ability.
  arXiv  Detail & Related papers  (2020-06-17T20:14:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.