A Hyperbolic Neural Closure for M1 Radiation Transfer

• URL: http://arxiv.org/abs/2607.10364v1
• Date: Sat, 11 Jul 2026 15:43:00 GMT
• Title: A Hyperbolic Neural Closure for M1 Radiation Transfer
• Abstract summary: In radiation transfer simulations, an M1 method achieves substantial computational savings by replacing the full angular transport equation with a low-order moment system.<n>Because this reduced system is not closed, a closure model is required to represent the unknown higher-order moments.<n>We propose a hyperbolic neural closure for the M1 radiative transfer system to guarantee real eigenvalues.
• Score: 9.065972458046089
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In radiation transfer simulations, an M1 method achieves substantial computational savings by replacing the full angular transport equation with a low-order moment system. Because this reduced system is not closed, a closure model is required to represent the unknown higher-order moments using lower-order moments. While machine learning (ML)-based closures can improve accuracy beyond classical analytic closures, unconstrained learned closures may produce non-real characteristic speeds and consequently cause numerical solver breakdown. To guarantee real eigenvalues of the Jacobian associated with ML closures, we propose a hyperbolic neural closure for the M1 radiative transfer system. Rather than directly predicting closure terms, we parameterize the Jacobian through two neural networks: (i) a symmetric matrix network and (ii) a strictly convex entropy network whose Hessian defines a positive definite symmetrizer. These components are combined to yield a Jacobian that is similar to a symmetric matrix, thereby ensuring real eigenvalues. The closure is then reconstructed by numerical integration of the learned Jacobian field along a prescribed integration path. Numerical experiments show that the proposed closure not only achieves higher closure accuracy than classical analytic closures, but also improves solution accuracy and remains stable in discontinuous Galerkin simulations for radiative transfer problems.

Related papers

• Attractor Geometry Determines the Identifiability Limits of System Discovery [0.764671395172401]
  We show that a single number, $_min(M)$, sets the identifiability ceiling for both sparse regression (SINDy) and evolutionary regression (PySR)<n>We also introduce Soft F1, a coefficient-weighted structural metric that resolves performance differences invisible to binary-success and predictive scores.
  arXiv  Detail & Related papers  (2026-07-20T20:19:19Z)
• Coverage Analysis of Rydberg Atom Quantum Receiver Arrays: A Stochastic Geometry Approach [55.47164192369501]
  Rydberg atomic quantum receivers (RAQRs) offer quantum-limited sensitivity and broadband tunability.<n>In dense deployments, aggregate interference can push atomic transducer out of its small-signal regime.<n>This paper addresses the question by embedding the RAQR front end into a geometry coverage analysis.
  arXiv  Detail & Related papers  (2026-05-22T04:05:13Z)
• Fast and Effective Computation of Generalized Symmetric Matrix Factorization [16.011610920688998]
  We present a non-smooth, non-Lipschitz generalized symmetric matrix factorization model.<n>The model unifies a broad class of matrix factorization formulations in machine learning, image science, engineering, and related areas.<n> numerical experiments on real datasets demonstrate the efficiency of ANAUM.
  arXiv  Detail & Related papers  (2026-03-19T17:03:52Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning [52.23804865017831]
  We address the problem of verifying closed-loop contraction in nonlinear control systems whose controller and contraction metric are both parameterized by neural networks.<n>We derive a tractable and scalable sufficient condition for closed-loop contractivity that reduces to checking that the dominant eigenvalue of a symmetric Metzler matrix is nonpositive.
  arXiv  Detail & Related papers  (2025-12-01T23:06:56Z)
• Zassenhaus Expansion in Solving the Schrödinger Equation [0.0]
  A fundamental challenge lies in approximating the unitary evolution operator ( e-imathcalHt ) where ( mathcalH ) is a large, typically non-commuting, Hermitian operator.<n>We present a refinement of the fixed-depth simulation framework introduced by E. K"okc"u et al, incorporating the second-order Zassenhaus expansion.<n>This yields a controlled, non-unitary approximation with error scaling as ( mathcalO(t
  arXiv  Detail & Related papers  (2025-05-14T14:48:47Z)
• Precision measurement for open systems by non-hermitian linear response [9.087477434347218]
  We first derive some general results regarding the lower bound of estimated precision for a dissipative parameter. This lower bound is related to the correlation of the encoding dissipative operator and the evolution time.
  arXiv  Detail & Related papers  (2024-06-17T07:51:02Z)
• Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency [53.90687548731265]
  We study optimal procedures for estimating a linear functional based on observational data. For any convex and symmetric function class $mathcalF$, we derive a non-asymptotic local minimax bound on the mean-squared error.
  arXiv  Detail & Related papers  (2023-01-16T02:57:37Z)
• $O(N^2)$ Universal Antisymmetry in Fermionic Neural Networks [107.86545461433616]
  We propose permutation-equivariant architectures, on which a determinant Slater is applied to induce antisymmetry. FermiNet is proved to have universal approximation capability with a single determinant, namely, it suffices to represent any antisymmetric function. We substitute the Slater with a pairwise antisymmetry construction, which is easy to implement and can reduce the computational cost to $O(N2)$.
  arXiv  Detail & Related papers  (2022-05-26T07:44:54Z)
• Machine learning moment closure models for the radiative transfer equation III: enforcing hyperbolicity and physical characteristic speeds [0.0]
  Third paper in a series in which we develop machine learning (ML) moment closure models for the radiative transfer equation (RTE) Motivated by the observation that the coefficient matrix of the closure system is lower Hessenberg matrix, we relate its eigenvalues to the roots of an associated neural network.
  arXiv  Detail & Related papers  (2021-09-02T04:16:56Z)
• Machine learning moment closure models for the radiative transfer equation II: enforcing global hyperbolicity in gradient based closures [0.0]
  This is the second paper in a series in which we develop machine learning (ML) moment closure models for the radiative transfer equation (RTE) We propose a method to enforce the global hyperbolicity of the ML closure model. It is shown that the new ML closure system inherits the dissipativeness of the RTE and preserves the correct diffusion limit as the Knunsden number goes to zero.
  arXiv  Detail & Related papers  (2021-05-30T02:10:59Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.