2023
DOI: 10.48550/arxiv.2301.13755
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Retrosynthetic Planning with Dual Value Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(7 citation statements)
references
References 0 publications
0
7
0
Order By: Relevance
“…Furthermore, most of these methods utilize significantly larger rule data sets than ours. For example, Retro*+, EG-MCTS, and PDVN all employed the 318k rule data set. In contrast, ReSynZ, as presented in this work, operated with a considerably smaller data set of up to 13k rules and used limited computing resources, yet still achieves commendable performance.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Furthermore, most of these methods utilize significantly larger rule data sets than ours. For example, Retro*+, EG-MCTS, and PDVN all employed the 318k rule data set. In contrast, ReSynZ, as presented in this work, operated with a considerably smaller data set of up to 13k rules and used limited computing resources, yet still achieves commendable performance.…”
Section: Discussionmentioning
confidence: 99%
“…Their method is dedicated to goal-driven synthesis planning but achieves decent performance in general planning as well. The PDVN algorithm trains one policy network and two value networks using data collected from route planning with the MCTS algorithm. PDVN also improves the three neural networks in an iterative fashion using reinforcement learning, and the policy network is continuously updated throughout the learning process, training with data collected from successful synthesis routes of target molecules.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…22,23 Finally, self-play approaches, motivated by their success in Go, 24 learn to guide the tree search by leveraging information gathered from prior runs of synthesis planning. [25][26][27] Single-step retrosynthesis prediction and multi-step synthesis planning are inherently intertwined where the single-step method denes the maximum searchable reaction network, and the search algorithm tries to efficiently traverse this network by repeatedly applying the chemical information that is stored in the single-step model. However, this connection is not reected in contemporary research, with only few novel single-step models testing their approaches within a multi-step synthesis planning framework.…”
Section: Introductionmentioning
confidence: 99%
“…These methods are typically only tested on reactant prediction and not within multi-step search algorithms, therefore their usability for synthesis planning is not assessed. Similarly, multi-step search algorithms benchmark the route-nding capabilities of their method using a single single-step model, oen based on the template-based NeuralSym model, 2,[18][19][20]27 and evaluate the success rate of nding potential synthesis routes for molecules of interest. However, multi-step approaches do not consider the impact of alternative single-step models, a vital aspect of the search, as the route planning algorithm uses the reaction information stored in the single-step model to nd synthesis routes and create alternate reaction pathways within the reaction network.…”
Section: Introductionmentioning
confidence: 99%