Pith. sign in

REVIEW 4 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.02913 v2 pith:67ZOASZR submitted 2024-03-05 math.NA cs.NA

classification math.NAcs.NA
keywords closurelearningproblemsmachinemodelsscientificapproachesbeen
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Why Does the Future Branch? Identifiable Closure Tests for Stochastic Physical World Models

    cs.AI 2026-08 conditional novelty 6.0 of 10

    ClosurePairs uses paired microstate and disturbance interventions with variance decomposition to identify whether future branching is caused by state aliasing or process noise, which ordinary prediction scores cannot.

  2. Locally Adaptive Conformal Inference for Operator Models

    stat.ML 2025-07 conditional novelty 6.0 of 10

    LSCI constructs function-valued, locally adaptive conformal prediction sets for operator models by weighting a functional depth score around the test input, with a coverage-gap bound under local exchangeability.

  3. Modeling Partially Observed Nonlinear Dynamical Systems and Efficient Data Assimilation via Discrete-Time Conditional Gaussian Koopman Network

    cs.LG 2025-07 conditional novelty 5.0 of 10

    A discrete-time conditional Gaussian Koopman network with analytical data-assimilation formulas is introduced and shown to match neural operator forecasts and ensemble Kalman filter assimilation on three PDE benchmarks.

  4. FIGNN: Feature-Specific Interpretability for Graph Neural Network Surrogate Models

    cs.LG 2025-06 conditional novelty 5.0 of 10

    FIGNN adds per-feature Top-K masking branches to a frozen GNN surrogate, producing variable-specific spatial attributions and error budgets for climate and fluid dynamics forecasts.

Pith tools