The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Learning Retrosynthetic Planning through Simulated Experience
Open accessAbstract
The problem of retrosynthetic planning can be framed as a one-player game, in which the chemist (or a computer program) works backward from a molecular target to simpler starting materials through a series of choices regarding which reactions to perform. This game is challenging as the combinatorial space of possible choices is astronomical, and the value of each choice remains uncertain until the synthesis plan is completed and its cost evaluated. Here, we address this search problem using deep reinforcement learning to identify policies that make (near) optimal reaction choices during each step of retrosynthetic planning according to a user-defined cost metric. Using a simulated experience, we train a neural network to estimate the expected synthesis cost or value of any given molecule based on a representation of its molecular structure. We show that learned policies based on this value network can outperform a heuristic approach that favors symmetric disconnections when synthesizing unfamiliar molecules from available starting materials using the fewest number of reactions. We discuss how the learned policies described here can be incorporated into existing synthesis planning tools and how they can be adapted to changes in the synthesis cost objective or material availability.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Mastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084
Weininger, D. (1988) · Journal of Chemical Information and Computer Sciences · doi:10.1021/ci00057a005 · Cited by 7,436
A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2018) · Science · doi:10.1126/science.aar6404 · Cited by 3,562
Planning chemical syntheses with deep neural networks and symbolic AI
Segler, M. H. S., Preuss, M., & Waller, M. P. (2018) · Nature · doi:10.1038/nature25978 · Cited by 1,847
Machine Learning in Computer-Aided Synthesis Planning
Coley, C. W., Green, W. H., & Jensen, K. F. (2018) · Accounts of Chemical Research · doi:10.1021/acs.accounts.8b00087 · Cited by 704
Self-citationA graph-convolutional neural network model for the prediction of chemical reactivity
Coley, C. W., Jin, W., Rogers, L., Jamison, T. F., Jaakkola, T. S., Green, W. H., Barzilay, R., & Jensen, K. F. (2019) · Chemical Science · doi:10.1039/c8sc04228d · Cited by 679
Self-citationComputer‐Assisted Synthetic Planning: The End of the Beginning
Szymkuć, S., Gajewska, E. P., Klucznik, T., Molga, K., Dittwald, P., Startek, M., Bajczyk, M., & Grzybowski, B. A. (2016) · Angewandte Chemie International Edition · doi:10.1002/anie.201506101 · Cited by 611
Neural‐Symbolic Machine Learning for Retrosynthesis and Reaction Prediction
Segler, M. H. S., & Waller, M. P. (2017) · Chemistry – A European Journal · doi:10.1002/chem.201605499 · Cited by 548
Retrosynthetic Reaction Prediction Using Neural Sequence-to-Sequence Models
Liu, B., Ramsundar, B., Kawthekar, P., Shi, J., Gomes, J., Luu Nguyen, Q., Ho, S., Sloane, J., Wender, P., & Pande, V. (2017) · ACS Central Science · doi:10.1021/acscentsci.7b00303 · Cited by 536
Using Machine Learning To Predict Suitable Conditions for Organic Reactions
Gao, H., Struble, T. J., Coley, C. W., Wang, Y., Green, W. H., & Jensen, K. F. (2018) · ACS Central Science · doi:10.1021/acscentsci.8b00357 · Cited by 431
Self-citationExpert System for Predicting Reaction Conditions: The Michael Reaction Case
Marcou, G., Aires de Sousa, J., Latino, D. A. R. S., de Luca, A., Horvath, D., Rietsch, V., & Varnek, A. (2015) · Journal of Chemical Information and Modeling · doi:10.1021/ci500698a · Cited by 86
Automatized Assessment of Protective Group Reactivity: A Step Toward Big Reaction Data Analysis
Lin, A. I., Madzhidov, T. I., Klimchuk, O., Nugmanov, R. I., Antipin, I. S., & Varnek, A. (2016) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.6b00319 · Cited by 51
Cited by
Schwaller, P., Petraglia, R., Zullo, V., Nair, V. H., Haeuselmann, R. A., Pisoni, R., Bekas, C., Iuliano, A., & Laino, T. (2020) · Chemical Science · doi:10.1039/c9sc05704h · Cited by 403
Autonomous Discovery in the Chemical Sciences Part I: Progress
Coley, C. W., Eyke, N. S., & Jensen, K. F. (2020) · Angewandte Chemie International Edition · doi:10.1002/anie.201909987 · Cited by 317
Self-citationSynthetic organic chemistry driven by artificial intelligence
de Almeida, A. F., Moreira, R., & Rodrigues, T. (2019) · Nature Reviews Chemistry · doi:10.1038/s41570-019-0124-0 · Cited by 303
Metadata
- Authors
- Schreck, J. S., Coley, C. W., & Bishop, K. J. M.
- Venue
- ACS Central Science
- Publisher
- American Chemical Society (ACS)
- Published
- 2019-05-31
- Volume
- 5
- Issue
- 6
- Pages
- 970-981
- ISSN
- 2374-7943 (ISSN-L)
- 2374-7951
- OpenAlex
- W2947835681
- Cited by
- 179
- References
- 14
- FWCI
- 18.33
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.