MotifRetro: Exploring the Combinability-Consistency Trade-offs in retrosynthesis via Dynamic Motif Editing

• URL: http://arxiv.org/abs/2305.15153v1
• Date: Sat, 20 May 2023 09:08:44 GMT
• Title: MotifRetro: Exploring the Combinability-Consistency Trade-offs in retrosynthesis via Dynamic Motif Editing
• Authors: Zhangyang Gao, Xingran Chen, Cheng Tan, Stan Z. Li
• Abstract summary: We propose a dynamic motif editing framework for retrosynthesis prediction. It can explore the entire trade-off space and unify graph-based models. We conduct experiments on USPTO-50K to explore how the trade-off affects the model performance.
• Score: 40.254832796139375
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Is there a unified framework for graph-based retrosynthesis prediction? Through analysis of full-, semi-, and non-template retrosynthesis methods, we discovered that they strive to strike an optimal balance between combinability and consistency: \textit{Should atoms be combined as motifs to simplify the molecular editing process, or should motifs be broken down into atoms to reduce the vocabulary and improve predictive consistency?} Recent works have studied several specific cases, while none of them explores different combinability-consistency trade-offs. Therefore, we propose MotifRetro, a dynamic motif editing framework for retrosynthesis prediction that can explore the entire trade-off space and unify graph-based models. MotifRetro comprises two components: RetroBPE, which controls the combinability-consistency trade-off, and a motif editing model, where we introduce a novel LG-EGAT module to dynamiclly add motifs to the molecule. We conduct extensive experiments on USPTO-50K to explore how the trade-off affects the model performance and finally achieve state-of-the-art performance.

Related papers

• UAlign: Pushing the Limit of Template-free Retrosynthesis Prediction with Unsupervised SMILES Alignment [51.49238426241974]
  This paper introduces UAlign, a template-free graph-to-sequence pipeline for retrosynthesis prediction. By combining graph neural networks and Transformers, our method can more effectively leverage the inherent graph structure of molecules.
  arXiv  Detail & Related papers  (2024-03-25T03:23:03Z)
• Controllable Topic-Focused Abstractive Summarization [57.8015120583044]
  Controlled abstractive summarization focuses on producing condensed versions of a source article to cover specific aspects. This paper presents a new Transformer-based architecture capable of producing topic-focused summaries.
  arXiv  Detail & Related papers  (2023-11-12T03:51:38Z)
• Node-Aligned Graph-to-Graph (NAG2G): Elevating Template-Free Deep Learning Approaches in Single-Step Retrosynthesis [12.713263007109518]
  Single-step retrosynthesis (SSR) in organic chemistry is increasingly benefiting from deep learning (DL) techniques in computer-synthesis design. While template-aided DL models are flexible and promising for retrosynthesis prediction, they often ignore vital 2D molecular information and struggle with atom alignment for node generation. We introduce Node-Aligned Graph-to-Graph (NAG2G), a transformer-based template-free DL model.
  arXiv  Detail & Related papers  (2023-09-27T17:16:32Z)
• Molecular Property Prediction by Semantic-invariant Contrastive Learning [26.19431931932982]
  We develop a Fragment-based Semantic-Invariant Contrastive Learning model based on this view generation method for molecular property prediction. With the least number of pre-training samples, FraSICL can achieve state-of-the-art performance, compared with major existing counterpart models.
  arXiv  Detail & Related papers  (2023-03-13T07:32:37Z)
• Dual Path Modeling for Semantic Matching by Perceiving Subtle Conflicts [14.563722352134949]
  Transformer-based pre-trained models have achieved great improvements in semantic matching. Existing models still suffer from insufficient ability to capture subtle differences. We propose a novel Dual Path Modeling Framework to enhance the model's ability to perceive subtle differences.
  arXiv  Detail & Related papers  (2023-02-24T09:29:55Z)
• ContraFeat: Contrasting Deep Features for Semantic Discovery [102.4163768995288]
  StyleGAN has shown strong potential for disentangled semantic control. Existing semantic discovery methods on StyleGAN rely on manual selection of modified latent layers to obtain satisfactory manipulation results. We propose a model that automates this process and achieves state-of-the-art semantic discovery performance.
  arXiv  Detail & Related papers  (2022-12-14T15:22:13Z)
• End-to-End Learning of Hybrid Inverse Dynamics Models for Precise and Compliant Impedance Control [16.88250694156719]
  We present a novel hybrid model formulation that enables us to identify fully physically consistent inertial parameters of a rigid body dynamics model. We compare our approach against state-of-the-art inverse dynamics models on a 7 degree of freedom manipulator.
  arXiv  Detail & Related papers  (2022-05-27T07:39:28Z)
• Energy-based View of Retrosynthesis [70.66156081030766]
  We propose a framework that unifies sequence- and graph-based methods as energy-based models. We present a novel dual variant within the framework that performs consistent training over Bayesian forward- and backward-prediction. This model improves state-of-the-art performance by 9.6% for template-free approaches where the reaction type is unknown.
  arXiv  Detail & Related papers  (2020-07-14T18:51:06Z)
• Learning Graph Models for Retrosynthesis Prediction [90.15523831087269]
  Retrosynthesis prediction is a fundamental problem in organic synthesis. This paper introduces a graph-based approach that capitalizes on the idea that the graph topology of precursor molecules is largely unaltered during a chemical reaction. Our model achieves a top-1 accuracy of $53.7%$, outperforming previous template-free and semi-template-based methods.
  arXiv  Detail & Related papers  (2020-06-12T09:40:42Z)

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.