Distance-Geometric Graph Attention Network (DG-GAT) for 3D Molecular Geometry

• URL: http://arxiv.org/abs/2207.08023v1
• Date: Sat, 16 Jul 2022 21:39:31 GMT
• Title: Distance-Geometric Graph Attention Network (DG-GAT) for 3D Molecular Geometry
• Authors: Daniel T. Chang
• Abstract summary: 3D distance-geometric graph representation (DG-GR) adopts a unified scheme (distance) for representing the geometry of 3D graphs. We propose the 3D distance-geometric graph attention network (DG-GAT) for use with DG-GR. Experimental results show major improvement over those of the standard graph convolution network based on 2D molecular graphs.
• Score: 0.8722210937404288
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Deep learning for molecular science has so far mainly focused on 2D molecular graphs. Recently, however, there has been work to extend it to 3D molecular geometry, due to its scientific significance and critical importance in real-world applications. The 3D distance-geometric graph representation (DG-GR) adopts a unified scheme (distance) for representing the geometry of 3D graphs. It is invariant to rotation and translation of the graph, and it reflects pair-wise node interactions and their generally local nature, particularly relevant for 3D molecular geometry. To facilitate the incorporation of 3D molecular geometry in deep learning for molecular science, we adopt the new graph attention network with dynamic attention (GATv2) for use with DG-GR and propose the 3D distance-geometric graph attention network (DG-GAT). GATv2 is a great fit for DG-GR since the attention can vary by node and by distance between nodes. Experimental results of DG-GAT for the ESOL and FreeSolv datasets show major improvement (31% and 38%, respectively) over those of the standard graph convolution network based on 2D molecular graphs. The same is true for the QM9 dataset. Our work demonstrates the utility and value of DG-GAT for deep learning based on 3D molecular geometry.

Related papers

• Geometry Informed Tokenization of Molecules for Language Model Generation [85.80491667588923]
  We consider molecule generation in 3D space using language models (LMs) Although tokenization of molecular graphs exists, that for 3D geometries is largely unexplored. We propose the Geo2Seq, which converts molecular geometries into $SE(3)$-invariant 1D discrete sequences.
  arXiv  Detail & Related papers  (2024-08-19T16:09:59Z)
• Automated 3D Pre-Training for Molecular Property Prediction [54.15788181794094]
  We propose a novel 3D pre-training framework (dubbed 3D PGT) It pre-trains a model on 3D molecular graphs, and then fine-tunes it on molecular graphs without 3D structures. Extensive experiments on 2D molecular graphs are conducted to demonstrate the accuracy, efficiency and generalization ability of the proposed 3D PGT.
  arXiv  Detail & Related papers  (2023-06-13T14:43:13Z)
• 3D Molecular Geometry Analysis with 2D Graphs [79.47097907673877]
  Ground-state 3D geometries of molecules are essential for many molecular analysis tasks. Modern quantum mechanical methods can compute accurate 3D geometries but are computationally prohibitive. We propose a novel deep learning framework to predict 3D geometries from molecular graphs.
  arXiv  Detail & Related papers  (2023-05-01T19:00:46Z)
• Unified 2D and 3D Pre-Training of Molecular Representations [237.36667670201473]
  We propose a new representation learning method based on a unified 2D and 3D pre-training. Atom coordinates and interatomic distances are encoded and then fused with atomic representations through graph neural networks. Our method achieves state-of-the-art results on 10 tasks, and the average improvement on 2D-only tasks is 8.3%.
  arXiv  Detail & Related papers  (2022-07-14T11:36:56Z)
• Pre-training Molecular Graph Representation with 3D Geometry [39.35244035710228]
  Molecular graphs are typically modeled by their 2D topological structures. Lack of 3D information in real-world scenarios has significantly impeded the learning of geometric graph representation. We propose the Graph Multi-View Pre-training (GraphMVP) framework where self-supervised learning is performed by leveraging the correspondence and consistency between 2D topological structures and 3D geometric views.
  arXiv  Detail & Related papers  (2021-10-07T17:48:57Z)
• Molecule3D: A Benchmark for Predicting 3D Geometries from Molecular Graphs [79.06686274377009]
  We develop a benchmark, known as Molecule3D, that includes a dataset with precise ground-state geometries of approximately 4 million molecules. We implement two baseline methods that either predict the pairwise distance between atoms or atom coordinates in 3D space. Our method can achieve comparable prediction accuracy but with much smaller computational costs.
  arXiv  Detail & Related papers  (2021-09-30T22:09:28Z)
• GeomGCL: Geometric Graph Contrastive Learning for Molecular Property Prediction [47.70253904390288]
  We propose a novel graph contrastive learning method utilizing the geometry of a molecule across 2D and 3D views. Specifically, we first devise a dual-view geometric message passing network (GeomMPNN) to adaptively leverage the rich information of both 2D and 3D graphs of a molecule.
  arXiv  Detail & Related papers  (2021-09-24T03:55:27Z)
• Distance-Geometric Graph Convolutional Network (DG-GCN) for Three-Dimensional (3D) Graphs [0.8722210937404288]
  We propose a message-passing graph convolutional network based on the distance-geometric graph representation: DG-GCN. It enables learning of filter weights from distances, thereby incorporating the geometry of 3D graphs in graph convolutions. Our work demonstrates the utility and value of DG-GCN for end-to-end deep learning on 3D graphs, particularly molecular graphs.
  arXiv  Detail & Related papers  (2020-07-06T15:20:52Z)
• Geometric Graph Representations and Geometric Graph Convolutions for Deep Learning on Three-Dimensional (3D) Graphs [0.8722210937404288]
  The geometry of three-dimensional (3D) graphs, consisting of nodes and edges, plays a crucial role in many important applications. We define three types of geometric graph representations: positional, angle-geometric and distance-geometric. For proof of concept, we use the distance-geometric graph representation for geometric graph convolutions. The results of geometric graph convolutions, for the ESOL and Freesol datasets, show significant improvement over those of standard graph convolutions.
  arXiv  Detail & Related papers  (2020-06-02T17:08:59Z)

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.