Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search
- URL: http://arxiv.org/abs/2006.15820v1
- Date: Mon, 29 Jun 2020 05:53:33 GMT
- Title: Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search
- Authors: Binghong Chen, Chengtao Li, Hanjun Dai, Le Song
- Abstract summary: Retrosynthetic planning identifies a series of reactions that can lead to the synthesis of a target product.
Existing methods either require expensive return estimation by rollout with high variance, or optimize for search speed rather than the quality.
We propose Retro*, a neural-based A*-like algorithm that finds high-quality synthetic routes efficiently.
- Score: 83.22850633478302
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Retro-prob: Retrosynthetic Planning Based on a Probabilistic Model [5.044138778500218]
Retrosynthesis is a fundamental but challenging task in organic chemistry.
Given a target molecule, the goal of retrosynthesis is to find out a series of reactions which could be assembled into a synthetic route.
We propose a new retrosynthetic planning algorithm called retro-prob to maximize the successful synthesis probability of target molecules.
arXiv Detail & Related papers (2024-05-25T08:23:40Z) - An Autonomous Large Language Model Agent for Chemical Literature Data
Mining [60.85177362167166]
We introduce an end-to-end AI agent framework capable of high-fidelity extraction from extensive chemical literature.
Our framework's efficacy is evaluated using accuracy, recall, and F1 score of reaction condition data.
arXiv Detail & Related papers (2024-02-20T13:21:46Z) - Evolutionary Retrosynthetic Route Planning [8.19851864095418]
This paper proposes a novel approach for retrosynthetic route planning based on evolutionary optimization.
It marks the first use of Evolutionary Algorithm (EA) in the field of multi-step retrosynthesis.
arXiv Detail & Related papers (2023-10-08T14:47:41Z) - RetroGraph: Retrosynthetic Planning with Graph Search [101.92603715499112]
Retrosynthetic planning aims to find a reaction pathway to synthesize a target molecule.
We propose a graph-based search policy that eliminates the redundant explorations of any intermediate molecules.
Our method can search a batch of targets together in the graph and remove the inter-target duplication in the tree-based search methods.
arXiv Detail & Related papers (2022-06-23T05:01:29Z) - Retrosynthetic Planning with Experience-Guided Monte Carlo Tree Search [10.67810457039541]
In retrosynthetic planning, the huge number of possible routes to synthesize a complex molecule leads to an explosion of possibilities.
Current approaches rely on human-defined or machine-trained score functions which have limited chemical knowledge.
We build an experience guidance network to learn knowledge from synthetic experiences during the search.
arXiv Detail & Related papers (2021-12-11T17:14:15Z) - Improving RNA Secondary Structure Design using Deep Reinforcement
Learning [69.63971634605797]
We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure.
We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
arXiv Detail & Related papers (2021-11-05T02:54:06Z) - Ranking Cost: Building An Efficient and Scalable Circuit Routing Planner
with Evolution-Based Optimization [49.207538634692916]
We propose a new algorithm for circuit routing, named Ranking Cost, to form an efficient and trainable router.
In our method, we introduce a new set of variables called cost maps, which can help the A* router to find out proper paths.
Our algorithm is trained in an end-to-end manner and does not use any artificial data or human demonstration.
arXiv Detail & Related papers (2021-10-08T07:22:45Z) - ChemiRise: a data-driven retrosynthesis engine [19.52621175562223]
ChemiRise can propose complete retrosynthesis routes for organic compounds rapidly and reliably.
System was trained on a processed patent database of over 3 million organic reactions.
arXiv Detail & Related papers (2021-08-09T05:13:14Z) - On the Exploitation of Neuroevolutionary Information: Analyzing the Past
for a More Efficient Future [60.99717891994599]
We propose an approach that extracts information from neuroevolutionary runs, and use it to build a metamodel.
We inspect the best structures found during neuroevolutionary searches of generative adversarial networks with varying characteristics.
arXiv Detail & Related papers (2021-05-26T20:55:29Z) - A Bayesian algorithm for retrosynthesis [3.1092085121563526]
This study is to discover synthetic routes backwardly from a given desired molecule to commercially available compounds.
A deep neural network is trained that forwardly predicts a product of the given reactants with a high level of accuracy.
Using the backward model, a diverse set of highly probable reaction sequences ending with a given synthetic target is exhaustively explored using a Monte Carlo search.
arXiv Detail & Related papers (2020-03-06T13:30:30Z)
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.