化学反应网络探索的终身机器学习潜力。

IF 5.5 1区 化学 Q2 CHEMISTRY, PHYSICAL
Marco Eckhoff*,  and , Markus Reiher*, 
{"title":"化学反应网络探索的终身机器学习潜力。","authors":"Marco Eckhoff*,&nbsp; and ,&nbsp;Markus Reiher*,&nbsp;","doi":"10.1021/acs.jctc.5c01127","DOIUrl":null,"url":null,"abstract":"<p >Recent developments in computational chemistry facilitate the automated quantum chemical exploration of chemical reaction networks for the in-silico prediction of synthesis pathways, yield, and selectivity. However, the underlying quantum chemical energy calculations require vast computational resources, limiting these explorations severely in practice. Machine learning potentials (MLPs) offer a solution to increase computational efficiency, while retaining the accuracy of reliable first-principles data used for their training. Unfortunately, MLPs will be limited in their generalization ability within chemical (reaction) space, if the underlying training data are not representative for a given application. Within the framework of automated reaction network exploration, where new reactants or reagents composed of any elements from the periodic table can be introduced, this lack of generalizability will be the rule rather than the exception. Here, we therefore evaluate the benefits of the lifelong MLP concept in this context. Lifelong MLPs push their adaptability by efficient continual learning of additional data. We propose an improved learning algorithm for lifelong adaptive data selection yielding efficient integration of new data while previous expertise is preserved. In this way, we can reach chemical accuracy in reaction search trials.</p>","PeriodicalId":45,"journal":{"name":"Journal of Chemical Theory and Computation","volume":"21 19","pages":"9641–9656"},"PeriodicalIF":5.5000,"publicationDate":"2025-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://pubs.acs.org/doi/pdf/10.1021/acs.jctc.5c01127","citationCount":"0","resultStr":"{\"title\":\"Lifelong Machine Learning Potentials for Chemical Reaction Network Explorations\",\"authors\":\"Marco Eckhoff*,&nbsp; and ,&nbsp;Markus Reiher*,&nbsp;\",\"doi\":\"10.1021/acs.jctc.5c01127\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p >Recent developments in computational chemistry facilitate the automated quantum chemical exploration of chemical reaction networks for the in-silico prediction of synthesis pathways, yield, and selectivity. However, the underlying quantum chemical energy calculations require vast computational resources, limiting these explorations severely in practice. Machine learning potentials (MLPs) offer a solution to increase computational efficiency, while retaining the accuracy of reliable first-principles data used for their training. Unfortunately, MLPs will be limited in their generalization ability within chemical (reaction) space, if the underlying training data are not representative for a given application. Within the framework of automated reaction network exploration, where new reactants or reagents composed of any elements from the periodic table can be introduced, this lack of generalizability will be the rule rather than the exception. Here, we therefore evaluate the benefits of the lifelong MLP concept in this context. Lifelong MLPs push their adaptability by efficient continual learning of additional data. We propose an improved learning algorithm for lifelong adaptive data selection yielding efficient integration of new data while previous expertise is preserved. In this way, we can reach chemical accuracy in reaction search trials.</p>\",\"PeriodicalId\":45,\"journal\":{\"name\":\"Journal of Chemical Theory and Computation\",\"volume\":\"21 19\",\"pages\":\"9641–9656\"},\"PeriodicalIF\":5.5000,\"publicationDate\":\"2025-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://pubs.acs.org/doi/pdf/10.1021/acs.jctc.5c01127\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Chemical Theory and Computation\",\"FirstCategoryId\":\"92\",\"ListUrlMain\":\"https://pubs.acs.org/doi/10.1021/acs.jctc.5c01127\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"CHEMISTRY, PHYSICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Chemical Theory and Computation","FirstCategoryId":"92","ListUrlMain":"https://pubs.acs.org/doi/10.1021/acs.jctc.5c01127","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, PHYSICAL","Score":null,"Total":0}
引用次数: 0

摘要

计算化学的最新发展促进了化学反应网络的自动量子化学探索,用于合成途径、产率和选择性的计算机预测。然而,潜在的量子化学能计算需要大量的计算资源,在实践中严重限制了这些探索。机器学习潜力(mlp)提供了一种提高计算效率的解决方案,同时保留了用于训练的可靠第一原理数据的准确性。不幸的是,如果潜在的训练数据不能代表给定的应用,mlp在化学(反应)空间内的泛化能力将受到限制。在自动反应网络探索的框架内,可以引入由元素周期表中的任何元素组成的新反应物或试剂,这种缺乏通用性将是规则而不是例外。因此,我们在此评估终身MLP概念在此背景下的好处。终身mlp通过有效地持续学习额外的数据来提高他们的适应性。我们提出了一种改进的终身自适应数据选择的学习算法,在保留以前的专业知识的同时有效地集成新数据。通过这种方法,我们可以在反应搜索试验中达到化学准确度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Lifelong Machine Learning Potentials for Chemical Reaction Network Explorations

Lifelong Machine Learning Potentials for Chemical Reaction Network Explorations

Recent developments in computational chemistry facilitate the automated quantum chemical exploration of chemical reaction networks for the in-silico prediction of synthesis pathways, yield, and selectivity. However, the underlying quantum chemical energy calculations require vast computational resources, limiting these explorations severely in practice. Machine learning potentials (MLPs) offer a solution to increase computational efficiency, while retaining the accuracy of reliable first-principles data used for their training. Unfortunately, MLPs will be limited in their generalization ability within chemical (reaction) space, if the underlying training data are not representative for a given application. Within the framework of automated reaction network exploration, where new reactants or reagents composed of any elements from the periodic table can be introduced, this lack of generalizability will be the rule rather than the exception. Here, we therefore evaluate the benefits of the lifelong MLP concept in this context. Lifelong MLPs push their adaptability by efficient continual learning of additional data. We propose an improved learning algorithm for lifelong adaptive data selection yielding efficient integration of new data while previous expertise is preserved. In this way, we can reach chemical accuracy in reaction search trials.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Chemical Theory and Computation
Journal of Chemical Theory and Computation 化学-物理:原子、分子和化学物理
CiteScore
9.90
自引率
16.40%
发文量
568
审稿时长
1 months
期刊介绍: The Journal of Chemical Theory and Computation invites new and original contributions with the understanding that, if accepted, they will not be published elsewhere. Papers reporting new theories, methodology, and/or important applications in quantum electronic structure, molecular dynamics, and statistical mechanics are appropriate for submission to this Journal. Specific topics include advances in or applications of ab initio quantum mechanics, density functional theory, design and properties of new materials, surface science, Monte Carlo simulations, solvation models, QM/MM calculations, biomolecular structure prediction, and molecular dynamics in the broadest sense including gas-phase dynamics, ab initio dynamics, biomolecular dynamics, and protein folding. The Journal does not consider papers that are straightforward applications of known methods including DFT and molecular dynamics. The Journal favors submissions that include advances in theory or methodology with applications to compelling problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信