Scientific machine learning for closure models in multiscale problems: a review
Benjamin Sanderse, Panos Stinis, Romit Maulik, Shady E. Ahmed

TL;DR
This review discusses how scientific machine learning techniques are used to develop closure models for multiscale systems, emphasizing the integration of physics-based and data-driven methods, and highlighting recent advances and ongoing challenges.
Contribution
It provides a comprehensive overview of current ML-based closure modeling approaches, including model forms, learning objectives, and the importance of physical laws, connecting to related research fields.
Findings
Progress has been made in ML-based closure models.
Physical law adherence improves model reliability.
Challenges in generalizability and interpretability remain.
Abstract
Closure problems are omnipresent when simulating multiscale systems, where some quantities and processes cannot be fully prescribed despite their effects on the simulation's accuracy. Recently, scientific machine learning approaches have been proposed as a way to tackle the closure problem, combining traditional (physics-based) modeling with data-driven (machine-learned) techniques, typically through enriching differential equations with neural networks. This paper reviews the different reduced model forms, distinguished by the degree to which they include known physics, and the different objectives of a priori and a posteriori learning. The importance of adhering to physical laws (such as symmetries and conservation laws) in choosing the reduced model form and choosing the learning method is discussed. The effect of spatial and temporal discretization and recent trends toward…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Modeling in Engineering
