Table of Contents
Fetching ...

Efficient Prior Calibration From Indirect Data

O. Deniz Akyildiz, Mark Girolami, Andrew M. Stuart, Arnaud Vadeboncoeur

TL;DR

This work develops a data-informed prior learning framework for Bayesian inverse problems by expressing the prior as a pushforward of a Gaussian, $(T^\alpha)_\# \mu_0$, and matching induced data distributions to observations via a sliced-Wasserstein divergence. It introduces a residual-based neural operator to approximate the forward map $F^\dagger$, forming a bilevel optimization scheme that jointly learns the prior and the operator when $F^\dagger$ is expensive or unknown. Theoretical results connect the method to Bayes when $N=1$ and empiricalizations, and the approach is demonstrated through Darcy flow inverse problems with level-set and lognormal priors, showing accurate parameter recovery and favorable computational properties. The framework supports scalable prior calibration from indirect data and simultaneous operator learning, enabling efficient, data-driven Bayesian inversion for complex PDE systems.

Abstract

Bayesian inversion is central to the quantification of uncertainty within problems arising from numerous applications in science and engineering. To formulate the approach, four ingredients are required: a forward model mapping the unknown parameter to an element of a solution space, often the solution space for a differential equation; an observation operator mapping an element of the solution space to the data space; a noise model describing how noise pollutes the observations; and a prior model describing knowledge about the unknown parameter before the data is acquired. This paper is concerned with learning the prior model from data; in particular, learning the prior from multiple realizations of indirect data obtained through the noisy observation process. The prior is represented, using a generative model, as the pushforward of a Gaussian in a latent space; the pushforward map is learned by minimizing an appropriate loss function. A metric that is well-defined under empirical approximation is used to define the loss function for the pushforward map to make an implementable methodology. Furthermore, an efficient residual-based neural operator approximation of the forward model is proposed and it is shown that this may be learned concurrently with the pushforward map, using a bilevel optimization formulation of the problem; this use of neural operator approximation has the potential to make prior learning from indirect data more computationally efficient, especially when the observation process is expensive, non-smooth or not known. The ideas are illustrated with the Darcy flow inverse problem of finding permeability from piezometric head measurements.

Efficient Prior Calibration From Indirect Data

TL;DR

This work develops a data-informed prior learning framework for Bayesian inverse problems by expressing the prior as a pushforward of a Gaussian, , and matching induced data distributions to observations via a sliced-Wasserstein divergence. It introduces a residual-based neural operator to approximate the forward map , forming a bilevel optimization scheme that jointly learns the prior and the operator when is expensive or unknown. Theoretical results connect the method to Bayes when and empiricalizations, and the approach is demonstrated through Darcy flow inverse problems with level-set and lognormal priors, showing accurate parameter recovery and favorable computational properties. The framework supports scalable prior calibration from indirect data and simultaneous operator learning, enabling efficient, data-driven Bayesian inversion for complex PDE systems.

Abstract

Bayesian inversion is central to the quantification of uncertainty within problems arising from numerous applications in science and engineering. To formulate the approach, four ingredients are required: a forward model mapping the unknown parameter to an element of a solution space, often the solution space for a differential equation; an observation operator mapping an element of the solution space to the data space; a noise model describing how noise pollutes the observations; and a prior model describing knowledge about the unknown parameter before the data is acquired. This paper is concerned with learning the prior model from data; in particular, learning the prior from multiple realizations of indirect data obtained through the noisy observation process. The prior is represented, using a generative model, as the pushforward of a Gaussian in a latent space; the pushforward map is learned by minimizing an appropriate loss function. A metric that is well-defined under empirical approximation is used to define the loss function for the pushforward map to make an implementable methodology. Furthermore, an efficient residual-based neural operator approximation of the forward model is proposed and it is shown that this may be learned concurrently with the pushforward map, using a bilevel optimization formulation of the problem; this use of neural operator approximation has the potential to make prior learning from indirect data more computationally efficient, especially when the observation process is expensive, non-smooth or not known. The ideas are illustrated with the Darcy flow inverse problem of finding permeability from piezometric head measurements.
Paper Structure (30 sections, 5 theorems, 50 equations, 12 figures, 2 algorithms)

This paper contains 30 sections, 5 theorems, 50 equations, 12 figures, 2 algorithms.

Key Result

Lemma 3.1

\newlabellemma:pushW0 For $P_\mathrm{B}(\cdot) = \mathrm{B}^{-1/2}\,\cdot$ it follows that

Figures (12)

  • Figure 1: (a) Spectrum decay of the square root of the eigen values for the covariance operator \ref{['eqn:GRF_operator']} (which corresponds to the standard deviation of the basis expansion coefficient of each mode $\varphi_{j}(x)$) for $\beta=4$ and different choices of lengthscale parameter $\lambda$. As $\lambda$ increases, more modes play a significant role. (b) A comparison of smooth level set function $\tilde{z}$ and sharp level set function $z$ transitioning at $x=0.5$ for $\tau=100$.
  • Figure 1: 2D FEM mesh centred at node $jk$. We assume equal spacing, $h$, of the nodes.
  • Figure 2: (a)-(c) Data Generated from sharp prior $\mu^\dagger$, which are the PDE solution fields with the observational data at points, the normalized GRF $\bar{a}$ samples, and one example of a level set function resulting from one of the $\bar{a}$ fields. (d) The same diffusivity field $\tilde{z}$ as in (c), but smoothed with \ref{['eqn:smooth_levelset_function']} and $\tau=10$.
  • Figure 3: Comparison of convergence of $\alpha=\{\kappa^\pm, \lambda\}$ for data generated from the physically realistic sharp $\mu^\dagger$ and the smoothed $\tilde{\mu}^\dagger$ for 1D Darcy with \ref{['eq:ideal_loss2']}. We plot in (a) and (c) the convergence of the parameters themselves, and in (b) and (d) the loss function values.
  • Figure 4: Converged parameter estimation for $\lambda, \kappa^+, \kappa^-$ individually, for different dataset sizes $N$, and number of samples $N_s$ for \ref{['eq:ideal_loss2']} on the 1D Darcy problem.
  • ...and 7 more figures

Theorems & Definitions (19)

  • Lemma 3.1
  • Proof 1
  • Remark 3.2
  • Remark 3.3
  • Theorem 3.4
  • Remark 3.5
  • Lemma 3.6
  • Proof 2
  • Lemma 3.7
  • Proof 3
  • ...and 9 more