mlsanityData to 7 Oct 2026

Machine learning moment closure models for the radiative transfer equation I: directly learning a gradient based closure

arXiv 2105.05690 ↗First posted 12 May 2021math.NA cs.LG cs.NAcited by 8

Not on the map. Why?

Abstract (arXiv)

In this paper, we take a data-driven approach and apply machine learning to the moment closure problem for radiative transfer equation in slab geometry. Instead of learning the unclosed high order moment, we propose to directly learn the gradient of the high order moment using neural networks. This new approach is consistent with the exact closure we derive for the free streaming limit and also provides a natural output normalization. A variety of benchmark tests, including the variable scattering problem, the Gaussian source problem with both periodic and reflecting boundaries, and the two-material problem, show both good accuracy and generalizability of our machine learning closure model.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 7 of its 62 references that are in the map. First posted on arXiv 12 May 2021.

Builds on

7 of 62 references.

References · 7

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2017Solving high-dimensional partial differential equations using deep learningcited by 549
  3. 2017Deep Potential Molecular Dynamics: a scalable model with the accuracy of quantum mechanicscited by 213
  4. 2020A fast and accurate physics-informed neural network reduced order model with shallow masked autoencodercited by 80
  5. 2020Physics Informed Neural Networks for Simulating Radiative Transfercited by 35
  6. 2020Learning Thermodynamically Stable and Galilean Invariant Partial Differential Equations for Non-equilibrium Flowscited by 7
  7. 2020Depth separation for reduced deep networks in nonlinear model reduction: Distilling shock waves in nonlinear hyperbolic problemscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 2; 2025: 1; 2026: 3.

8 papers.