SEAM: Global consistency beyond local accuracy in scientific machine learning
Not on the map. Why?
Abstract (arXiv)
Scientific machine learning commonly validates models at the level of a subdomain, a benchmark split, or an explanation for one prediction. Yet such local checks cannot establish whether the resulting explanations can be assembled into one globally admissible explanation. We introduce Scientific Explanation-Admissibility Machines (SEAM), a generator-agnostic framework that makes this local-to-global consistency question computable across regions, sensors, regimes, and model components. The finite explanation-sheaf instantiation SEAM-Omega represents each region by a structured explanation with state, closure, and observation channels together with optional contract metadata; compares neighboring explanations on their overlaps; and converts disagreement into a channel-resolved obstruction. This obstruction locates inconsistency and tests competing declared accounts by restricting each repair to the revisions that one account permits. Exact feasibility refutes or retains an account; when exact repair is unavailable, residual-aware regularized records provide a separately labeled empirical attribution. The framework also separates inconsistency from non-identifiability and monitors learned generators under distribution shift. We establish theorems for minimum-cost intervention and conservation-contract detectability, together with companion results for identifiability and closure recoverability. Across nineteen experiments involving synthetic partial differential equation systems and out-of-distribution Fourier neural operator (FNO) monitoring, SEAM detects incompatible explanations even when local predictions are accurate, and attributes failures to specific channels and overlaps. SEAM adds a global explanation-consistency audit to existing solvers and learning models, testing whether their local explanations form a coherent scientific account.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 7 of its 28 references that are in the map. First posted on arXiv 6 Aug 2026.
Builds on
7 of 28 references.
References · 7
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,143
- 2020Fourier Neural Operator for Parametric Partial Differential Equationscited by 2,857
- 2019DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operatorscited by 1,989
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,278
- 2021Characterizing possible failure modes in physics-informed neural networkscited by 637
- 2020Universal Differential Equations for Scientific Machine Learningcited by 350
- 2018Failing Loudly: An Empirical Study of Methods for Detecting Dataset Shiftcited by 241
Built on by
Not cited yet.