回顾性分析
水准点(测量)
计算机科学
人工神经网络
人工智能
机器学习
质量(理念)
波束搜索
树(集合论)
任务(项目管理)
决策树
搜索算法
数据挖掘
算法
工程类
数学
数学分析
哲学
认识论
有机化学
化学
全合成
系统工程
地理
大地测量学
作者
Binghong Chen,Chengtao Li,Hanjun Dai,Le Song
出处
期刊:International Conference on Machine Learning
日期:2020-07-12
卷期号:1: 1608-1616
被引量:4
摘要
Retrosynthetic planning is a critical task in organic chemistry which identifies a series of reactions that can lead to the synthesis of a target product. The vast number of possible chemical transformations makes the size of the search space very big, and retrosynthetic planning is challenging even for experienced chemists. However, existing methods either require expensive return estimation by rollout with high variance, or optimize for search speed rather than the quality. In this paper, we propose Retro*, a neural-based A*-like algorithm that finds high-quality synthetic routes efficiently. It maintains the search as an AND-OR tree, and learns a neural search bias with off-policy data. Then guided by this neural network, it performs best-first search efficiently during new planning episodes. Experiments on benchmark USPTO datasets show that, our proposed method outperforms existing state-of-the-art with respect to both the success rate and solution quality, while being more efficient at the same time.
科研通智能强力驱动
Strongly Powered by AbleSci AI