Doubly Stochastic Graph-based Non-autoregressive Reaction Prediction

• URL: http://arxiv.org/abs/2306.06119v1
• Date: Mon, 5 Jun 2023 14:15:39 GMT
• Title: Doubly Stochastic Graph-based Non-autoregressive Reaction Prediction
• Authors: Ziqiao Meng, Peilin Zhao, Yang Yu, Irwin King
• Abstract summary: We propose a new framework called that combines two doubly self-attention mappings to obtain electron redistribution predictions. We show that our approach consistently improves the predictive performance of non-autoregressive models.
• Score: 59.41636061300571
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Organic reaction prediction is a critical task in drug discovery. Recently, researchers have achieved non-autoregressive reaction prediction by modeling the redistribution of electrons, resulting in state-of-the-art top-1 accuracy, and enabling parallel sampling. However, the current non-autoregressive decoder does not satisfy two essential rules of electron redistribution modeling simultaneously: the electron-counting rule and the symmetry rule. This violation of the physical constraints of chemical reactions impairs model performance. In this work, we propose a new framework called that combines two doubly stochastic self-attention mappings to obtain electron redistribution predictions that follow both constraints. We further extend our solution to a general multi-head attention mechanism with augmented constraints. To achieve this, we apply Sinkhorn's algorithm to iteratively update self-attention mappings, which imposes doubly conservative constraints as additional informative priors on electron redistribution modeling. We theoretically demonstrate that our can simultaneously satisfy both rules, which the current decoder mechanism cannot do. Empirical results show that our approach consistently improves the predictive performance of non-autoregressive models and does not bring an unbearable additional computational cost.

Related papers

• Beyond the Typical: Modeling Rare Plausible Patterns in Chemical Reactions by Leveraging Sequential Mixture-of-Experts [42.9784548283531]
  Generative models like Transformer and VAE have typically been employed to predict the reaction product. We propose organizing the mapping space between reactants and electron redistribution patterns in a divide-and-conquer manner.
  arXiv  Detail & Related papers  (2023-10-07T03:18:26Z)
• Regularized Vector Quantization for Tokenized Image Synthesis [126.96880843754066]
  Quantizing images into discrete representations has been a fundamental problem in unified generative modeling. deterministic quantization suffers from severe codebook collapse and misalignment with inference stage while quantization suffers from low codebook utilization and reconstruction objective. This paper presents a regularized vector quantization framework that allows to mitigate perturbed above issues effectively by applying regularization from two perspectives.
  arXiv  Detail & Related papers  (2023-03-11T15:20:54Z)
• DR-Label: Improving GNN Models for Catalysis Systems by Label Deconstruction and Reconstruction [72.20024514713633]
  We present a novel graph neural network (GNN) supervision and prediction strategy DR-Label. The strategy enhances the supervision signal, reduces the multiplicity of solutions in edge representation, and encourages the model to provide node predictions robust. DR-Label was applied to three radically distinct models, each of which displayed consistent performance enhancements.
  arXiv  Detail & Related papers  (2023-03-06T04:01:28Z)
• Suppressing nonperturbative gauge errors in the thermodynamic limit using local pseudogenerators [0.0]
  A gauge-protection scheme has been proposed that is based on the concept of a textitlocal pseudogenerator. We show the efficacy of this scheme for nonperturbative errors in analog quantum simulators up to all accessible evolution times in the thermodynamic limit. Our results indicate the presence of an emergent gauge symmetry in an adjusted gauge theory even in the thermodynamic limit.
  arXiv  Detail & Related papers  (2021-10-13T18:00:01Z)
• Discovering Latent Causal Variables via Mechanism Sparsity: A New Principle for Nonlinear ICA [81.4991350761909]
  Independent component analysis (ICA) refers to an ensemble of methods which formalize this goal and provide estimation procedure for practical application. We show that the latent variables can be recovered up to a permutation if one regularizes the latent mechanisms to be sparse.
  arXiv  Detail & Related papers  (2021-07-21T14:22:14Z)
• Non-Autoregressive Electron Redistribution Modeling for Reaction Prediction [26.007965383304864]
  We devise a non-autoregressive learning paradigm that predicts reaction in one shot. We formulate a reaction as an arbitrary electron flow and predict it with a novel multi-pointer decoding network. Experiments on the USPTO-MIT dataset show that our approach has established a new state-of-the-art top-1 accuracy.
  arXiv  Detail & Related papers  (2021-06-08T16:39:08Z)
• Non-autoregressive electron flow generation for reaction prediction [15.98143959075733]
  We devise a novel decoder that avoids such sequential generating and predicts the reaction in a Non-Autoregressive manner. Inspired by physical-chemistry insights, we represent edge edits in a molecule graph as electron flows, which can then be predicted in parallel. Our model achieves both an order of magnitude lower inference latency, with state-of-the-art top-1 accuracy and comparable performance on Top-K sampling.
  arXiv  Detail & Related papers  (2020-12-16T10:01:26Z)
• Signatures of Chaos in Non-integrable Models of Quantum Field Theory [0.0]
  We study signatures of quantum chaos in (1+1)D Quantum Field Theory (QFT) models. We focus on the double sine-Gordon, also studying the massive sine-Gordon and $phi4$ model.
  arXiv  Detail & Related papers  (2020-12-15T18:56:20Z)
• Competitive Mirror Descent [67.31015611281225]
  Constrained competitive optimization involves multiple agents trying to minimize conflicting objectives, subject to constraints. We propose competitive mirror descent (CMD): a general method for solving such problems based on first order information. As a special case we obtain a novel competitive multiplicative weights algorithm for problems on the positive cone.
  arXiv  Detail & Related papers  (2020-06-17T22:11:35Z)
• Retrosynthesis Prediction with Conditional Graph Logic Network [118.70437805407728]
  Computer-aided retrosynthesis is finding renewed interest from both chemistry and computer science communities. We propose a new approach to this task using the Conditional Graph Logic Network, a conditional graphical model built upon graph neural networks.
  arXiv  Detail & Related papers  (2020-01-06T05:36:57Z)

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.