(hierarchical) bayesian level set...

31
(Hierarchical) Bayesian Level Set Method Andrew Stuart Mathematical Institute, University of Warwick, U.K. Workshop on Multiscale UQ, IPAM, UCLA, January 20th–23rd, 2016. EPSRC, ERC, ONR (Andrew Stuart) http://homepages.warwick.ac.uk/masdr Bayesian Inversion 1 / 31

Upload: others

Post on 24-Jul-2020

3 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

(Hierarchical) Bayesian Level Set Method

Andrew Stuart

Mathematical Institute, University of Warwick, U.K.

Workshop on Multiscale UQ,IPAM, UCLA,

January 20th–23rd, 2016.

EPSRC, ERC, ONR

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 1 / 31

Page 2: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Outline

1 Introduction

2 Classical Level Set Inversion

3 Bayesian Level Set Inversion

4 Hierarchical Bayesian Level Set Inversion

5 Conclusions

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 2 / 31

Page 3: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Outline

1 Introduction

2 Classical Level Set Inversion

3 Bayesian Level Set Inversion

4 Hierarchical Bayesian Level Set Inversion

5 Conclusions

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 3 / 31

Page 4: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Level Set Representation

S.Osher and J.SethianFronts propagating with curvature-dependent speed . . . .J. Comp. Phys. 79(1988), 12–49.

Piecewise constant function v defined through thresholding acontinuous level set function u. Let

−∞ = c0 < c1 < · · · < cK−1 < cK =∞.

v(x) =K∑

k=1

vk I{ck−1<u≤ck}(x); v = F (u).

F : X 7→ Z is the level-set map., X cts fns. Z piecewise cts fns.(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 4 / 31

Page 5: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Level Set Inversion

F. SantosaA level-set approach for inverse problems . . .ESAIM 1(96), 17–33.

G : Z → RJ and η ∈ RJ a realization of an observational noise.

Inverse Problem

Find v ∈ Z , given y ∈ RJ satisfying y = G(v) + η.

Prior Knowledgev is piecewise constant taking a finite set of prescribed values.Interfaces unknown. Write v = F (u) and view u as the unknown.

Model-Data Misfit

The model-data misfit is Φ(u; y) = 12

∣∣∣Γ−1/2(y − G ◦ F (u))∣∣∣2.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 5 / 31

Page 6: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Example 1: Image Reconstruction

H.W. Engl, M. Hanke and A. NeubauerRegularization of Inverse ProblemsKluwer(1994)

Forward Problem

Define K : Z → RJ by (Kv)j = v(xj), xj ∈ D ⊂ Rd . Given v ∈ Z

y = Kv .

Let η ∈ RJ be a realization of an observational noise.

Inverse Problem

Given prior information v = F (u), u ∈ X and y ∈ RJ , find v :

y = Kv + η.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 6 / 31

Page 7: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Example 2: Groundwater FlowM. Dashti and A.M. StuartThe Bayesian approach to inverse problems.Handbook of Uncertainty QuantificationEditors: R. Ghanem, D.Higdon and H. Owhadi, Springer, 2017.arXiv:1302.6989

Forward Problem: Darcy Flow

Let X+ := {v ∈ Z : essinfx∈Dv > 0}. Given κ ∈ X+, find y := G(κ) ∈ RJ

where yj = `j(p),V := H10 (D), `j ∈ V ∗, j = 1, . . . , J and

−∇ · κ∇p = f in D,p = 0 in ∂D..

Let η ∈ RJ be a realization of an observational noise.

Inverse Problem

Given prior information κ = F (u), u ∈ X and y ∈ RJ , find κ :

y = G(κ) + η.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 7 / 31

Page 8: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Example 3: Electrical Impedance TomographyM. Dunlop and A.M. StuartBayesian formulation of EIT.arXiv:1509.03136Inverse Problems and Imaging, Submitted, 2015.

Apply currents I` on e`, ` = 1, . . . ,L.Induces voltages Θ` on e`, ` = 1, . . . ,L.We have an Ohm’s law Θ = R(σ)I.σ is conductivity of the interior.

D

el

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 8 / 31

Page 9: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Example 3: Electrical Impedance Tomography

Forward Problem: Steady Maxwell Equations

Given σ ∈ X+, find (θ,Θ) ∈ H1(D)× RL :

−∇ · σ∇θ = 0 in D, σ∂θ

∂ν= 0 on ∂D\ ∪` e`,∫

e`σ∂θ

∂νdS = I`, and θ + z`σ

∂θ

∂ν= Θ` on e`, ` = 1, · · · ,L.

Let η ∈ RL be a realization of an observational noise.

Invere Problem (Ohm’s Law)

Given prior information σ = F (u), u ∈ X and currents I and y ∈ RL,find σ :

y = R(σ)I + η.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 9 / 31

Page 10: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Outline

1 Introduction

2 Classical Level Set Inversion

3 Bayesian Level Set Inversion

4 Hierarchical Bayesian Level Set Inversion

5 Conclusions

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 10 / 31

Page 11: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Tikhonov Regularization

G : Z → RJ and η ∈ RJ a realization of an observational noise.

Inverse Problem

Find u ∈ X , given y ∈ RJ satisfying y = G ◦ F (u) + η.

Model-Data Misfit

The model-data misfit is Φ(u; y) = 12

∣∣∣Γ−1/2(y − G ◦ F (u))∣∣∣2.

Tikhonov RegularizationMinimize, for some E compactly embedded into X ,

I(u; y) := Φ(u; y) +12‖u‖2E .

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 11 / 31

Page 12: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Issues

Issues:F is discontinuous.How to impose length scales via regularization?How to choose amplitude scales ck in F?

Plan for talk:Explain these issues in the classical setting.Show how the Bayesian reformulation addresses them all.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 12 / 31

Page 13: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Discontinuity of Level Set Map

F (·) is continuous at u F (·) is discontinuous at u

v = F (u) := v+ I{u≥0}(x) + v− I{u<0}(x).

Causes problems in classical level set inversion.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 13 / 31

Page 14: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Length-Scale Matters

Figure demonstrates role of length-scale in level-set function.Classical Tikhonov-Phillips regularization does not allow for directcontrol of the length-scale.

New ideas needed.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 14 / 31

Page 15: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Amplitude Matters

Y. LuProbabilistic Analysis of Interface ProblemsPhD Thesis (2016), Warwick University

Consider case of K = 2, c1 = 0.For contradiction assume u? is a minimizer of I(u; y).

Now define the sequence uε = εu?. Then if 0 < ε < 1,

Φ(uε; y) = Φ(u?; y), ‖uε‖E = ε‖u?‖E ⇒ I(uε; y) < I(u?; y).

Hence I(uε; y) is an infimizing sequence. But uε → 0 andI(0; y) > I(uε; y) for ε� 1.Thus infimum cannot be attained.This issue caused by thresholding at 0. But idea generalizes.

Choice of threshold matters.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 15 / 31

Page 16: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Outline

1 Introduction

2 Classical Level Set Inversion

3 Bayesian Level Set Inversion

4 Hierarchical Bayesian Level Set Inversion

5 Conclusions

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 16 / 31

Page 17: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Informal Approach

The Idea: WordsProblem is under-determined; data is noisy. Probability deliversmissing information and accounts for observational noise.

The Idea: PictureG = G ◦ F . Find u from y = G(u) + η.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 17 / 31

Page 18: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Physicists Approach

The Idea: Bayes’ Formula

P(u|y) ∝ P(y |u)P(u),

posterior ∝ likelihood× prior.

The Idea: Annealing

P(u) = N(0,C)

‖ · ‖2E = 〈·,C−1·〉

I(u; y) = Φ(u; y) +12‖u‖2E .

P(u|y) ∝ exp(−I(u; y)

).

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 18 / 31

Page 19: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Rigorous ApproachM. Iglesias, Y. Lu and A. M . StuartA level-set approach to Bayesian geometric inverse problems.arXiv:1504.00313

M. IglesiasA regularizing iterative ensemble Kalman method for PDE constrained inverse problems.arXiv:1505.03876

L2ν(X ; S) = {f : X → S : Eν‖f (u)‖2S <∞}.

Theorem (Iglesias, Lu and S)Let µ0(du) = P(du) and µy (du) = P(du|y). Assume that u ∈ X µ0−a.s.Then for Examples 1–3 (and more) µy � µ0 and y 7→ µy (du) isLipschitz in the Hellinger metric. Furthermore, if S is a separableBanach space and f ∈ L2

µ0(X ; S), then∥∥Eµy1 f (u)− Eµ

y2 f (u)∥∥

S ≤ C|y1 − y2|.

Key idea in proof is that F : X → Z is continuous µ0− a.s.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 19 / 31

Page 20: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Whittle-Matern Priors

c(x , y) = σ2 12ν−1Γ(ν)

(τ |x − y |)νKν(τ |x − y |).

ν controls smoothness – draws from Gaussian fields with thiscovariance have ν fractional Sobolev and Hölder derivatives.τ is an inverse length-scale.σ is an amplitude scale.

CWM(σ,τ) ∝ σ2τ2ν(τ2I −4)−ν−d2 .

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 20 / 31

Page 21: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Example 2: Groundwater Flow

0 0.2 0.4 0.6 0.8 10

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

1.5

2

2.5

3

3.5

4

4.5

5

5.5

6

6.5

Figure: (Row 1, τ = 15) Logarithm of the true hydraulic conductivity. (Row 2τ = 10,30,50,70,90) samples of F (u). (Row 3) F (E(u)). (Row 4) E(F (u).

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 21 / 31

Page 22: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Outline

1 Introduction

2 Classical Level Set Inversion

3 Bayesian Level Set Inversion

4 Hierarchical Bayesian Level Set Inversion

5 Conclusions

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 22 / 31

Page 23: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Hierarchical Whittle-Matern Priors (The Problem)

Prior:P(u, τ) = P(u|τ)P(τ).

P(u|τ) = N(0,CWM(σ,τ)).

Recall CWM(σ,τ) ∝ σ2τ2ν(τ2I −4)−ν−d2 .

TheoremFor fixed σ the family of measures N(0,CWM(σ,·)) are mutually singular.

Algorithms which attempt to move between singular measures performbadly under mesh refinement (since they fail completely in the fullyresolved limit).

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 23 / 31

Page 24: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Hierarchical Whittle-Matern Priors (The Solution)M. Dunlop, M. Iglesias and A. M . StuartHierarchical Bayesian Level Set InversionarXiv:1601.03605

Hence choose σ = τ−ν and define: Cτ ∝ (τ2I −4)−ν−d2 . Prior:

P(u, τ) = P(u|τ)P(τ).

P(u|τ) = N(0,Cτ ).

TheoremThe family of measures N(0,Cτ ) are mutually equivalent.

Suggests need to scale thresholds in F by τ. Let

−∞ = c0 < c1 < · · · < cK−1 < cK =∞.

v(x) =K∑

k=1

vk I{ck−1<uτν≤ck}(x); v = F (u, τ).

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 24 / 31

Page 25: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Hierarchical Posterior

Prior

P(u, τ) = N(0,Cτ )P(τ),

Cτ ∝ (τ2I −4)−ν−d2 .

Model-Data Misfit

The model-data misfit is Φ(u, τ ; y) = 12

∣∣∣Γ−1/2(y − G ◦ F (u, τ))∣∣∣2.

Likelihood P(y |u, τ) ∝ exp(−Φ(u, τ ; y)

).

Posterior

I(u, τ ; y) = Φ(u, τ ; y) +12‖C−

12

τ u‖2 − logP(τ),

P(u, τ |y) ∝ exp(−I(u, τ ; y)

).

Same well-posedness theory as in non-hierarchical case.(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 25 / 31

Page 26: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

MCMC

We implement a Metropolis-within-Gibbs algorithm to generate aposterior-invariant Markov chain (uk , τk ):

Propose vk+1 from a P(u|τk )−reversible kernel.uk+1 = vk+1 w.p. 1 ∧ exp(Φ(uk , τk )− Φ(vk+1, τk )),uk+1 = uk otherwise.Propose tk+1 from a P(τ)−reversible kernel.τk+1 = tk+1 w.p. 1 ∧ exp(Φ(uk+1, τk )− Φ(uk+1, tk+1))w(τk , tk+1),τk+1 = τk otherwise.

Here w(τ, t) is density of N(0,Ct ) with respect to N(0,Cτ ).

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 26 / 31

Page 27: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Example 2: Groundwater Flow

0 0.2 0.4 0.6 0.8 10

0.1

0.2

0.3

0.4

0.5

0.6

0.7

0.8

0.9

1

1.5

2

2.5

3

3.5

4

4.5

5

5.5

6

6.5

Figure: (Row 1, τ = 15) Logarithm of the true hydraulic conductivity (middle,top). (Row 2 τ = 10,30,50,70,90) samples of F (u, τ). (Row 3)F (E(u),E(τ)). (Row 4) E(F (u, τ)).

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 27 / 31

Page 28: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

Outline

1 Introduction

2 Classical Level Set Inversion

3 Bayesian Level Set Inversion

4 Hierarchical Bayesian Level Set Inversion

5 Conclusions

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 28 / 31

Page 29: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

SummaryLast 5 years development of a theoretical and computational frameworkfor infinite dimensional Bayesian inversion with wide applicability:

1 Framework allows for noisy data and uncertain prior information.2 Probabilistic well-posedness.3 Theory clearly delineates (and links) analysis and probability.4 Theory leads to new algorithms (defined on Banach space).5 Grid-independent convergence rates for MCMC.

The methodology has been extended to solve interface problems. This isachieved via the level set representation.

1 Level set method becomes well-posed in this setting.2 Discontinuity in level set map is a probability zero event.3 Hierarchical choice of length-scale improves performance.4 Amplitude scale is linked to length-scale via measure equivalence.5 Algorithms which reflect this link are mesh-invariant.

Potential for many future developments for both applications and theory:1 Applications: subsurface imaging, medical imaging.2 Theory: inhomogenous length-scales, new hierarchies.

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 29 / 31

Page 30: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

References

S.L.Cotter, G.O.Roberts, A.M. Stuart, and D. White.MCMC methods for functions: modifying old algorithms to make them faster.Statistical Science, 28(2013), 424-446. arXiv:1202.0709.

M. Dashti, K.J.H.Law, A. M . Stuart and J.Voss.MAP estimators and posterior consistency in Bayesian nonparametric inverse problems.Inverse Problems 29(2013), 095017. arXiv:1303.4795.

M. Dashti and A.M. StuartThe Bayesian approach to inverse problems.Handbook of Uncertainty QuantificationEditors: R. Ghanem, D.Higdon and H. Owhadi, Springer, 2017.arXiv:1302.6989

M. Dunlop and A.M. StuartBayesian formulation of EIT.Inverse Problems and Imaging, Submitted, 2015. arXiv:1509.03136

M. Dunlop, M. A.Iglesias and A.M. StuartHierarchical Bayesian Inversion.Statistics and Computing, Submitted, 2015. arXiv:1601.03605

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 30 / 31

Page 31: (Hierarchical) Bayesian Level Set Methodhelper.ipam.ucla.edu/publications/uq2016/uq2016_13110.pdf · 1 Level set method becomes well-posed in this setting. 2 3. M. Dashti and A.M

References

M. Hairer, A.M. Stuart and S. VollmerSpectral gaps for Metropolis Hastings algorithms in infinite dimensionsAnn. App. Prob. 24(2014) arXiv:1112.1392

M.A.Iglesias, K.Lin and A.M.StuartWell-posed Bayesian geometric inverse problems arising in subsurface flow.Inverse Problems, 30(2014), 114001. arXiv:1401.5571

M. A. Iglesias, Y. Lu and A. M . StuartA level-set approach to Bayesian geometric inverse problems.Interfaces and Free Boundaries, Submitted, 2015. arXiv:1504.00313

A.M. Stuart.Inverse problems: a Bayesian perspective.Acta Numerica, 19(2010) 451–559.http://homepages.warwick.ac.uk/ masdr/BOOKCHAPTERS/stuart15c.pdf

(Andrew Stuart) http://homepages.warwick.ac.uk/∼masdr Bayesian Inversion 31 / 31