{"title":"Meta-learning innovates chemical kinetics: An efficient approach for surrogate model construction","authors":"Chenyue Tao, Chengcheng Liu, Yiru Wang, Bin Yang","doi":"10.1016/j.proci.2025.105860","DOIUrl":null,"url":null,"abstract":"<div><div>The construction of surrogate models is an essential step in the uncertainty quantification of combustion reaction kinetics. These models create a mapping between inputs and outputs of combustion kinetics simulations, thereby replacing the time-consuming numerical simulations of reaction kinetics and significantly lowering the computational costs for uncertainty quantification. However, in applications such as experimental design that require repeated construction of surrogate models under multiple operating conditions, the associated computational burden becomes substantial and can even limit the feasibility of the entire task. It is therefore essential to investigate cost-efficient surrogate model construction methods. Drawing inspiration from image classification in computer vision, this work introduces a meta-learning-assisted approach to efficiently construct surrogate models by leveraging the intrinsic shared features among them. By learning from a limited set of training tasks, the approach facilitates rapid creating surrogate models for new conditions with fewer samples. This is particularly beneficial for reducing computational costs since the most significant expense comes from the generation of original samples. The method has been tested in ammonia-hydrogen combustion targeting ignition delay time and laminar burning velocity. Results show that the efficiency of the surrogate model construction can be improved by a factor of eight for individual new conditions, and the total computational costs across the entire condition range can be reduced to 29 % and 37 % of the original values for the two prediction targets, respectively. Notably, dual pretraining across both prediction targets further enhances model performance. The meta-learning-assisted surrogate model construction approach is applicable across a broad range of operating conditions, requiring only minimal additional pretraining costs while offering flexible precision control based on task-specific requirements.</div></div>","PeriodicalId":408,"journal":{"name":"Proceedings of the Combustion Institute","volume":"41 ","pages":"Article 105860"},"PeriodicalIF":5.2000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Combustion Institute","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1540748925000744","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
引用次数: 0
Abstract
The construction of surrogate models is an essential step in the uncertainty quantification of combustion reaction kinetics. These models create a mapping between inputs and outputs of combustion kinetics simulations, thereby replacing the time-consuming numerical simulations of reaction kinetics and significantly lowering the computational costs for uncertainty quantification. However, in applications such as experimental design that require repeated construction of surrogate models under multiple operating conditions, the associated computational burden becomes substantial and can even limit the feasibility of the entire task. It is therefore essential to investigate cost-efficient surrogate model construction methods. Drawing inspiration from image classification in computer vision, this work introduces a meta-learning-assisted approach to efficiently construct surrogate models by leveraging the intrinsic shared features among them. By learning from a limited set of training tasks, the approach facilitates rapid creating surrogate models for new conditions with fewer samples. This is particularly beneficial for reducing computational costs since the most significant expense comes from the generation of original samples. The method has been tested in ammonia-hydrogen combustion targeting ignition delay time and laminar burning velocity. Results show that the efficiency of the surrogate model construction can be improved by a factor of eight for individual new conditions, and the total computational costs across the entire condition range can be reduced to 29 % and 37 % of the original values for the two prediction targets, respectively. Notably, dual pretraining across both prediction targets further enhances model performance. The meta-learning-assisted surrogate model construction approach is applicable across a broad range of operating conditions, requiring only minimal additional pretraining costs while offering flexible precision control based on task-specific requirements.
期刊介绍:
The Proceedings of the Combustion Institute contains forefront contributions in fundamentals and applications of combustion science. For more than 50 years, the Combustion Institute has served as the peak international society for dissemination of scientific and technical research in the combustion field. In addition to author submissions, the Proceedings of the Combustion Institute includes the Institute''s prestigious invited strategic and topical reviews that represent indispensable resources for emergent research in the field. All papers are subjected to rigorous peer review.
Research papers and invited topical reviews; Reaction Kinetics; Soot, PAH, and other large molecules; Diagnostics; Laminar Flames; Turbulent Flames; Heterogeneous Combustion; Spray and Droplet Combustion; Detonations, Explosions & Supersonic Combustion; Fire Research; Stationary Combustion Systems; IC Engine and Gas Turbine Combustion; New Technology Concepts
The electronic version of Proceedings of the Combustion Institute contains supplemental material such as reaction mechanisms, illustrating movies, and other data.