Self-Improved Retrosynthetic Planning

被引:0
|
作者
Kim, Junsu [1 ]
Ahn, Sungsoo [2 ]
Lee, Hankook [1 ]
Shin, Jinwoo [1 ]
机构
[1] Korea Adv Inst Sci & Technol KAIST, Daejeon, South Korea
[2] Mohamed Bin Zayed Univ Artificial Intelligence MB, Abu Dhabi, U Arab Emirates
关键词
TRANSFORMER;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Retrosynthetic planning is a fundamental problem in chemistry for finding a pathway of reactions to synthesize a target molecule. Recently, search algorithms have shown promising results for solving this problem by using deep neural networks (DNNs) to expand their candidate solutions, i.e., adding new reactions to reaction pathways. However, the existing works on this line are suboptimal; the retrosynthetic planning problem requires the reaction pathways to be (a) represented by real-world reactions and (b) executable using "building block" molecules, yet the DNNs expand reaction pathways without fully incorporating such requirements. Motivated by this, we propose an endto-end framework for directly training the DNNs towards generating reaction pathways with the desirable properties. Our main idea is based on a self-improving procedure that trains the model to imitate successful trajectories found by itself. We also propose a novel reaction augmentation scheme based on a forward reaction model. Our experiments demonstrate that our scheme significantly improves the success rate of solving the retrosynthetic problem from 86.84% to 96.32% while maintaining the performance of DNN for predicting valid reactions.
引用
收藏
页数:10
相关论文
共 50 条
  • [31] Self-improved butterfly optimization algorithm based cooperative routing model in Wireless Multimedia Sensor Networks
    Nagalingayya M.
    Mathpati B.S.
    Measurement: Sensors, 2022, 24
  • [32] Efficient retrosynthetic planning with MCTS exploration enhanced A* search
    Zhao, Dengwei
    Tu, Shikui
    Xu, Lei
    COMMUNICATIONS CHEMISTRY, 2024, 7 (01)
  • [33] Retro*: Learning Retrosynthetic Planning with Neural Guided A* Search
    Chen, Binghong
    Li, Chengtao
    Dai, Hanjun
    Song, Le
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119
  • [34] Efficient retrosynthetic planning with MCTS exploration enhanced A* search
    Dengwei Zhao
    Shikui Tu
    Lei Xu
    Communications Chemistry, 7
  • [35] Retrosynthetic accessibility score (RAscore) - rapid machine learned synthesizability classification from AI driven retrosynthetic planning
    Thakkar, Amol
    Chadimova, Veronika
    Bjerrum, Esben Jannik
    Engkvist, Ola
    Reymond, Jean-Louis
    CHEMICAL SCIENCE, 2021, 12 (09) : 3339 - 3349
  • [36] GNN-Retro: Retrosynthetic Planning with Graph Neural Networks
    Han, Peng
    Zhao, Peilin
    Lu, Chan
    Huang, Junzhou
    Wu, Jiaxiang
    Shang, Shuo
    Yao, Bin
    Zhang, Xiangliang
    THIRTY-SIXTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FOURTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE / THE TWELVETH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2022, : 4014 - 4021
  • [37] GRASP: Navigating Retrosynthetic Planning with Goal-driven Policy
    Yu, Yemin
    Wei, Ying
    Kuang, Kun
    Huang, Zhengxing
    Yao, Huaxiu
    Wu, Fei
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35 (NEURIPS 2022), 2022,
  • [38] Novel deterministic and probabilistic combined system based on deep learning and self-improved optimization algorithm for wind speed forecasting
    Lv, Mengzheng
    Li, Jing
    Niu, Xinsong
    Wang, Jianzhou
    SUSTAINABLE ENERGY TECHNOLOGIES AND ASSESSMENTS, 2022, 52
  • [39] Robust image watermarking scheme with transform domain technique on resisting different attacks: impact of self-improved optimization algorithm
    Gorbal, Mangalagowri
    Shelke, Ramesh D.
    Joshi, Manuj
    INTERNATIONAL JOURNAL OF SYSTEM ASSURANCE ENGINEERING AND MANAGEMENT, 2025, : 1163 - 1187
  • [40] Computer-assisted retrosynthetic planning as a tool for organic chemists
    Zhou, Yubai
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2018, 256