arXiv Analytics

Sign in

arXiv:2403.02913 [math.NA]AbstractReferencesReviewsResources

Scientific machine learning for closure models in multiscale problems: a review

Benjamin Sanderse, Panos Stinis, Romit Maulik, Shady E. Ahmed

Published 2024-03-05, updated 2024-09-12Version 2

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 discretization-invariant models are reviewed. In addition, we make the connections between closure problems and several other research disciplines: inverse problems, Mori-Zwanzig theory, and multi-fidelity methods. In conclusion, much progress has been made with scientific machine learning approaches for solving closure problems, but many challenges remain. In particular, the generalizability and interpretability of learned models is a major issue that needs to be addressed further.

Related articles: Most relevant | Search more
arXiv:1610.07398 [math.NA] (Published 2016-10-24)
Contrast independent localization of multiscale problems
arXiv:2109.02147 [math.NA] (Published 2021-09-05)
HEI: hybrid explicit-implicit learning for multiscale problems
arXiv:1410.3253 [math.NA] (Published 2014-10-13)
A reduced basis localized orthogonal decomposition