Theory-guided hard constraint projection (HCP): A knowledge-based data-driven scientific machine learning method

被引:93
作者
Chen, Yuntian [1 ]
Huang, Dou [2 ]
Zhang, Dongxiao [3 ]
Zeng, Junsheng [1 ]
Wang, Nanzhe [4 ,5 ]
Zhang, Haoran [2 ,6 ,7 ]
Yan, Jinyue [6 ]
机构
[1] Peng Cheng Lab, Frontier Res Ctr, Intelligent Energy Lab, Shenzhen 518000, Peoples R China
[2] Univ Tokyo, Ctr Spatial Informat Sci, Chiba 2778568, Japan
[3] Southern Univ Sci & Technol, Sch Environm Sci & Engn, Shenzhen 518055, Peoples R China
[4] Peking Univ, BIC ESAT, ERE, Beijing 100871, Peoples R China
[5] Peking Univ, Coll Engn, SKLTCS, Beijing 100871, Peoples R China
[6] Malardalen Univ, Future Energy Ctr, S-72123 Vasteras, Sweden
[7] LocationMind Inc, Tokyo 1010032, Japan
基金
中国国家自然科学基金;
关键词
Hard constraint; Theory guided; Physics informed; Sparse observation; Projection; Constraint patch; NEURAL-NETWORK; DESIGN; MODEL;
D O I
10.1016/j.jcp.2021.110624
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Machine learning models have been successfully used in many scientific and engineering fields. However, it remains difficult for a model to simultaneously utilize domain knowledge and experimental observation data. The application of knowledge-based symbolic artificial intelligence (AI) represented by expert systems is limited by the expressive ability of the model, and data-driven connectionism AI represented by neural networks is prone to produce predictions that might violate physical principles. In order to fully integrate domain knowledge with observations and make full use of the strong fitting ability of neural networks, this study proposes theory-guided hard constraint projection (HCP). This deep learning model converts physical constraints, such as governing equations, into a form that is easy to handle through discretization, and then implements hard constraint optimization through projection in a patch. Based on rigorous mathematical proofs, theory-guided HCP can ensure that model predictions strictly conform to physical mechanisms in the constraint patch. The training process of theory-guided HCP only needs a small amount of labeled data (sparse observation), and it can supervise the model by combining the coordinates (label-free data) with domain knowledge. The performance of the theory-guided HCP is verified by experiments based on a published heterogeneous subsurface flow problem. The experiments show that theory-guided HCP requires fewer data, and achieves higher prediction accuracy and stronger robustness to noisy observations, than the fully connected neural networks and soft constraint models. Furthermore, due to the application of domain knowledge, theory-guided HCP possesses the ability to extrapolate and can accurately predict points outside of the range of the training dataset. (C) 2021 The Author(s). Published by Elsevier Inc.
引用
收藏
页数:26
相关论文
共 42 条
[1]  
Baker N., 2019, Workshop Report on Basic Research Needs for Scientific Machine Learning: Core Technologies for Artificial Intelligence
[2]  
Beucler T., 2019, ARXIV PREPRINT ARXIV
[3]  
Boyd S., 2015, LECT NOTES EE263
[4]  
Buchanan B.G., 1984, Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project
[5]   Deep blue [J].
Campbell, M ;
Hoane, AJ ;
Hsu, FH .
ARTIFICIAL INTELLIGENCE, 2002, 134 (1-2) :57-83
[6]  
Chen Y, ADV APPL ENERGY, V1
[7]   Physics-constrained indirect supervised learning [J].
Chen, Yuntian ;
Zhang, Dongxiao .
THEORETICAL AND APPLIED MECHANICS LETTERS, 2020, 10 (03) :155-160
[8]  
Dong Yinpeng, 2017, ARXIV PREPRINT ARXIV
[9]   APPLICATION OF KARHUNEN-LOEVE EXPANSION TO FEATURE SELECTION AND ORDERING [J].
FUKUNAGA, K ;
KOONTZ, WLG .
IEEE TRANSACTIONS ON COMPUTERS, 1970, C 19 (04) :311-&