Pith. sign in

REVIEW 3 cited by

Approximate Bayesian Neural Operators: Uncertainty Quantification for Parametric PDEs

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 2208.01565 v1 pith:GZNJQ2JN submitted 2022-08-02 cs.LG cs.NAmath.NA

classification cs.LGcs.NAmath.NA
keywords neuraloperatorsuncertaintybayesiandeeppdesquantificationapproximate
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. 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.

  2. From Local Interactions to Global Operators: Scalable Gaussian Process Operator for Physical Systems

    stat.ML 2025-06 conditional novelty 5.0 of 10

    LoGoS-GPO combines nearest-neighbor spatial kernels, inducing-point sparsity, Kronecker structure, and a wavelet neural operator mean to make Gaussian Process Operators scalable while retaining uncertainty quantification.

  3. Epistemic Artificial Intelligence is Essential for Machine Learning Models to Truly 'Know When They Do Not Know'

    cs.AI 2025-05 conditional novelty 3.0 of 10

    Machine learning should use second-order uncertainty measures, such as credal sets and random sets, so models can explicitly represent ignorance and avoid overconfident predictions on unfamiliar data.

Pith tools