DeepGraphMol, a multi-objective, computational strategy for generating molecules with desirable properties: a graph convolution and reinforcement learning approach

Khemchandani, Yash, O’Hagan, Stephen, Samanta, Soumitra, Swainston, Neil, Roberts, Timothy, Bollegala, Danushka ORCID: 0000-0003-4476-7003 and Kell, Douglas ORCID: 0000-0001-5838-7963 (2020) DeepGraphMol, a multi-objective, computational strategy for generating molecules with desirable properties: a graph convolution and reinforcement learning approach 2020.05.25.114165-. ISSN 2692-8205

Text v2_stamped.pdf - Submitted version Download (1MB) | Preview

Abstract

We address the problem of generating novel molecules with desired interaction properties as a multi-objective optimization problem. Interaction binding models are learned from binding data using graph convolution networks (GCNs). Since the experimentally obtained property scores are recognised as having potentially gross errors, we adopted a robust loss for the model. Combinations of these terms, including drug likeness and synthetic accessibility, are then optimized using reinforcement learning based on a graph convolution policy approach. Some of the molecules generated, while legitimate chemically, can have excellent drug-likeness scores but appear unusual. We provide an example based on the binding potency of small molecules to dopamine transporters. We extend our method successfully to use a multi-objective reward function, in this case for generating novel molecules that bind with dopamine transporters but not with those for norepinephrine. Our method should be generally applicable to the generation in silico of molecules with desirable properties.

Item Type:	Article
Uncontrolled Keywords:	46 Information and Computing Sciences, 4602 Artificial Intelligence, Networking and Information Technology R&D (NITRD), Generic health relevance
Depositing User:	Symplectic Admin
Date Deposited:	27 Aug 2020 15:13
Last Modified:	25 May 2026 23:07
DOI:	10.1101/2020.05.25.114165
Related Websites:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3099009
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.