Parallel tempered genetic algorithm guided by deep neural networks for inverse molecular design

被引:46
作者
Nigam, AkshatKumar [1 ,2 ,3 ]
Pollice, Robert [2 ,3 ]
Aspuru-Guzik, Alan [2 ,3 ,4 ,5 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA USA
[2] Univ Toronto, Dept Comp Sci, Toronto, ON, Canada
[3] Univ Toronto, Dept Chem, Toronto, ON, Canada
[4] Vector Inst Artificial Intelligence, Toronto, ON, Canada
[5] Canadian Inst Adv Res CIFAR, 661 Univ Ave, Toronto, ON M5G 1M1, Canada
来源
DIGITAL DISCOVERY | 2022年 / 1卷 / 04期
基金
瑞士国家科学基金会;
关键词
NOVO DRUG DESIGN; MULTIOBJECTIVE OPTIMIZATION; AUTOMATED GENERATION; SYSTEM; SMILES; CHEMBL;
D O I
10.1039/d2dd00003b
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
Inverse molecular design involves algorithms that sample molecules with specific target properties from a multitude of candidates and can be posed as an optimization problem. High-dimensional optimization tasks in the natural sciences are commonly tackled via population-based metaheuristic optimization algorithms such as evolutionary algorithms. However, often unavoidable expensive property evaluation can limit the widespread use of such approaches as the associated cost can become prohibitive. Herein, we present JANUS, a genetic algorithm inspired by parallel tempering. It propagates two populations, one for exploration and another for exploitation, improving optimization by reducing property evaluations. JANUS is augmented by a deep neural network that approximates molecular properties and relies on active learning for enhanced molecular sampling. It uses the SELFIES representation and the STONED algorithm for the efficient generation of structures, and outperforms other generative models in common inverse molecular design tasks achieving state-of-the-art target metrics across multiple benchmarks. As neither most of the benchmarks nor the structure generator in JANUS account for synthesizability, a significant fraction of the proposed molecules is synthetically infeasible demonstrating that this aspect needs to be considered when evaluating the performance of molecular generative models. We present JANUS, an evolutionary algorithm for inverse molecular design. It propagates an explorative and an exploitative population exchanging members via parallel tempering and uses active learning via deep neural networks to enhance sampling.
引用
收藏
页码:390 / 404
页数:15
相关论文
共 89 条
[81]  
Wesolowski S. S., 2016, The strategies and politics of successful design, make, test, and analyze (dmta) cycles in lead generation, P487, DOI [10.1002/9783527677047.ch17, DOI 10.1002/9783527677047.CH17]
[82]   PRO-LIGAND - AN APPROACH TO DE-NOVO MOLECULAR DESIGN .3. A GENETIC ALGORITHM FOR STRUCTURE REFINEMENT [J].
WESTHEAD, DR ;
CLARK, DE ;
FRENKEL, D ;
LI, J ;
MURRAY, CW ;
ROBSON, B ;
WASZKOWYCZ, B .
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 1995, 9 (02) :139-148
[83]   Genetic algorithms in molecular recognition and design [J].
Willett, P .
TRENDS IN BIOTECHNOLOGY, 1995, 13 (12) :516-521
[84]   Efficient multi-objective molecular optimization in a continuous latent space [J].
Winter, Robin ;
Montanari, Floriane ;
Steffen, Andreas ;
Briem, Hans ;
Noe, Frank ;
Clevert, Djork-Arne .
CHEMICAL SCIENCE, 2019, 10 (34) :8016-8024
[85]  
Xie Y, 2021, INT C LEARN REPR
[86]   ChemTS: an efficient python']python library for de novo molecular generation [J].
Yang, Xiufeng ;
Zhang, Jinzhe ;
Yoshizoe, Kazuki ;
Terayama, Kei ;
Tsuda, Koji .
SCIENCE AND TECHNOLOGY OF ADVANCED MATERIALS, 2017, 18 (01) :972-976
[87]   Efficient Exploration of Chemical Space with Docking and Deep Learning [J].
Yang, Ying ;
Yao, Kun ;
Repasky, Matthew P. ;
Leswing, Karl ;
Abel, Robert ;
Shoichet, Brian K. ;
Jerome, Steven, V .
JOURNAL OF CHEMICAL THEORY AND COMPUTATION, 2021, 17 (11) :7106-7119
[88]  
You JX, 2018, ADV NEUR IN, V31
[89]   Optimization of Molecules via Deep Reinforcement Learning [J].
Zhou, Zhenpeng ;
Kearnes, Steven ;
Li, Li ;
Zare, Richard N. ;
Riley, Patrick .
SCIENTIFIC REPORTS, 2019, 9 (1)