Discovery of Probabilistic Dirichlet-to-Neumann Maps on Graphs
This addresses the challenge of reliable uncertainty quantification in scientific applications with limited data, though it appears to be an incremental/hybrid approach combining existing techniques.
The authors tackled the problem of coupling multiphysics simulations across computational subdomains by developing a novel method to learn Dirichlet-to-Neumann maps on graphs using Gaussian processes, which maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity in applications like subsurface fracture networks and arterial blood flow.
Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning Dirichlet-to-Neumann maps on graphs using Gaussian processes, specifically for problems where the data obey a conservation constraint from an underlying partial differential equation. Our approach combines discrete exterior calculus and nonlinear optimal recovery to infer relationships between vertex and edge values. This framework yields data-driven predictions with uncertainty quantification across the entire graph, even when observations are limited to a subset of vertices and edges. By optimizing over the reproducing kernel Hilbert space norm while applying a maximum likelihood estimation penalty on kernel complexity, our method ensures that the resulting surrogate strictly enforces conservation laws without overfitting. We demonstrate our method on two representative applications: subsurface fracture networks and arterial blood flow. Our results show that the method maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity, highlighting its potential for scientific applications where limited data and reliable uncertainty quantification are critical.