Distributed Reinforcement Learning for Molecular Design: Antioxidant case

• URL: http://arxiv.org/abs/2312.01267v1
• Date: Sun, 3 Dec 2023 03:23:13 GMT
• Title: Distributed Reinforcement Learning for Molecular Design: Antioxidant case
• Authors: Huanyi Qin, Denis Akhiyarov, Sophie Loehle, Kenneth Chiu, and Mauricio Araya-Polo
• Abstract summary: DA-MolDQN is a distributed reinforcement learning algorithm for antioxidants. It is 100x faster than previous algorithms and can discover new optimized molecules from proprietary and public antioxidants.
• Score: 0.20971479389679337
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Deep reinforcement learning has successfully been applied for molecular discovery as shown by the Molecule Deep Q-network (MolDQN) algorithm. This algorithm has challenges when applied to optimizing new molecules: training such a model is limited in terms of scalability to larger datasets and the trained model cannot be generalized to different molecules in the same dataset. In this paper, a distributed reinforcement learning algorithm for antioxidants, called DA-MolDQN is proposed to address these problems. State-of-the-art bond dissociation energy (BDE) and ionization potential (IP) predictors are integrated into DA-MolDQN, which are critical chemical properties while optimizing antioxidants. Training time is reduced by algorithmic improvements for molecular modifications. The algorithm is distributed, scalable for up to 512 molecules, and generalizes the model to a diverse set of molecules. The proposed models are trained with a proprietary antioxidant dataset. The results have been reproduced with both proprietary and public datasets. The proposed molecules have been validated with DFT simulations and a subset of them confirmed in public "unseen" datasets. In summary, DA-MolDQN is up to 100x faster than previous algorithms and can discover new optimized molecules from proprietary and public antioxidants.

Related papers

• Conditional Synthesis of 3D Molecules with Time Correction Sampler [58.0834973489875]
  Time-Aware Conditional Synthesis (TACS) is a novel approach to conditional generation on diffusion models. It integrates adaptively controlled plug-and-play "online" guidance into a diffusion model, driving samples toward the desired properties.
  arXiv  Detail & Related papers  (2024-11-01T12:59:25Z)
• Variational Autoencoding Molecular Graphs with Denoising Diffusion Probabilistic Model [0.0]
  We propose a novel deep generative model that incorporates a hierarchical structure into the probabilistic latent vectors. We demonstrate that our model can design effective molecular latent vectors for molecular property prediction from some experiments by small datasets on physical properties and activity.
  arXiv  Detail & Related papers  (2023-07-02T17:29:41Z)
• Molecule Design by Latent Space Energy-Based Modeling and Gradual Distribution Shifting [53.44684898432997]
  Generation of molecules with desired chemical and biological properties is critical for drug discovery. We propose a probabilistic generative model to capture the joint distribution of molecules and their properties. Our method achieves very strong performances on various molecule design tasks.
  arXiv  Detail & Related papers  (2023-06-09T03:04:21Z)
• Towards Predicting Equilibrium Distributions for Molecular Systems with Deep Learning [60.02391969049972]
  We introduce a novel deep learning framework, called Distributional Graphormer (DiG), in an attempt to predict the equilibrium distribution of molecular systems. DiG employs deep neural networks to transform a simple distribution towards the equilibrium distribution, conditioned on a descriptor of a molecular system.
  arXiv  Detail & Related papers  (2023-06-08T17:12:08Z)
• HD-Bind: Encoding of Molecular Structure with Low Precision, Hyperdimensional Binary Representations [3.3934198248179026]
  Hyperdimensional Computing (HDC) is a proposed learning paradigm that is able to leverage low-precision binary vector arithmetic. We show that HDC-based inference methods are as much as 90 times more efficient than more complex representative machine learning methods.
  arXiv  Detail & Related papers  (2023-03-27T21:21:46Z)
• De novo PROTAC design using graph-based deep generative models [2.566673015346446]
  We show that a graph-based generative model can be used to propose PROTAC-like structures from empty graphs. We steer the generative model towards compounds with higher likelihoods of predicted degradation activity. After fine-tuning, predicted activity against a challenging POI increases from 50% to >80% with near-perfect chemical validity.
  arXiv  Detail & Related papers  (2022-11-04T15:34:45Z)
• Exploring Chemical Space with Score-based Out-of-distribution Generation [57.15855198512551]
  We propose a score-based diffusion scheme that incorporates out-of-distribution control in the generative differential equation (SDE) Since some novel molecules may not meet the basic requirements of real-world drugs, MOOD performs conditional generation by utilizing the gradients from a property predictor. We experimentally validate that MOOD is able to explore the chemical space beyond the training distribution, generating molecules that outscore ones found with existing methods, and even the top 0.01% of the original training pool.
  arXiv  Detail & Related papers  (2022-06-06T06:17:11Z)
• Conditional $\beta$-VAE for De Novo Molecular Generation [0.0]
  We present a recurrent, conditional $beta$-VAE which disentangles the latent space to enhance post hoc molecule optimization. We create a mutual information driven training protocol and data augmentations to both increase molecular validity and promote longer sequence generation.
  arXiv  Detail & Related papers  (2022-05-01T17:38:05Z)
• Molecular Attributes Transfer from Non-Parallel Data [57.010952598634944]
  We formulate molecular optimization as a style transfer problem and present a novel generative model that could automatically learn internal differences between two groups of non-parallel data. Experiments on two molecular optimization tasks, toxicity modification and synthesizability improvement, demonstrate that our model significantly outperforms several state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-11-30T06:10:22Z)
• MIMOSA: Multi-constraint Molecule Sampling for Molecule Optimization [51.00815310242277]
  generative models and reinforcement learning approaches made initial success, but still face difficulties in simultaneously optimizing multiple drug properties. We propose the MultI-constraint MOlecule SAmpling (MIMOSA) approach, a sampling framework to use input molecule as an initial guess and sample molecules from the target distribution.
  arXiv  Detail & Related papers  (2020-10-05T20:18: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.