LGNAAug 2, 2022

Approximate Bayesian Neural Operators: Uncertainty Quantification for Parametric PDEs

arXiv:2208.01565v124 citationsh-index: 53
Originality Incremental advance
AI Analysis

This addresses the problem of error detection in PDE-based dynamical systems for researchers and practitioners, though it is incremental as it extends existing neural operator methods.

The paper tackles the lack of uncertainty quantification in neural operators for solving parametric PDEs, resulting in a Bayesian formulation that provides structured uncertainty estimates to identify prediction failures.

Neural operators are a type of deep architecture that learns to solve (i.e. learns the nonlinear solution operator of) partial differential equations (PDEs). The current state of the art for these models does not provide explicit uncertainty quantification. This is arguably even more of a problem for this kind of tasks than elsewhere in machine learning, because the dynamical systems typically described by PDEs often exhibit subtle, multiscale structure that makes errors hard to spot by humans. In this work, we first provide a mathematically detailed Bayesian formulation of the ''shallow'' (linear) version of neural operators in the formalism of Gaussian processes. We then extend this analytic treatment to general deep neural operators using approximate methods from Bayesian deep learning. We extend previous results on neural operators by providing them with uncertainty quantification. As a result, our approach is able to identify cases, and provide structured uncertainty estimates, where the neural operator fails to predict well.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes