• Aucun résultat trouvé

Bayesian Inference of Model Error in Imprecise Models

N/A
N/A
Protected

Academic year: 2021

Partager "Bayesian Inference of Model Error in Imprecise Models"

Copied!
36
0
0

Texte intégral

(1)

HAL Id: hal-03119715

https://hal.archives-ouvertes.fr/hal-03119715

Submitted on 25 Jan 2021

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of

sci-entific research documents, whether they are

pub-lished or not. The documents may come from

teaching and research institutions in France or

abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est

destinée au dépôt et à la diffusion de documents

scientifiques de niveau recherche, publiés ou non,

émanant des établissements d’enseignement et de

recherche français ou étrangers, des laboratoires

publics ou privés.

Bayesian Inference of Model Error in Imprecise Models

Nicolas Leoni, Pietro Congedo, Olivier Le Maitre, Maria-Giovanna Rodio

To cite this version:

Nicolas Leoni, Pietro Congedo, Olivier Le Maitre, Maria-Giovanna Rodio. Bayesian Inference of Model

Error in Imprecise Models. WCCM-ECCOMAS, Jan 2021, Paris, France. �hal-03119715�

(2)

DE LA RECHERCHE `A L’INDUSTRIE

B

AYESIAN INFERENCE OF MODEL ERROR

IN IMPRECISE MODELS

January 2021, ECCOMAS Congress (online)

Nicolas Leoni1 2 Pietro Congedo2 Olivier Le Maˆıtre3 Maria-Giovanna 1

(3)

Contents

Context

Model error and Calibration

Analytical example with gaussian posteriors

Numerical example

(4)

Contents

Context

Model error and Calibration

Analytical example with gaussian posteriors Numerical example

(5)

Numerical simulation in nuclear safety

Image source : Framatome

I A reliable simulation of the reactor is needed for risk prevention ;

I Physical models exist for each component of the reactor,

I These models are calibrated separately then used together,

I Modelling assumptions can lead to inaccurate predictions.

To make more realistic predictions :

Need to estimate uncertainties linked to modeling assumptions, namely ”model error”.

(6)

Contents

Context

Model error and Calibration

Analytical example with gaussian posteriors Numerical example

(7)

Calibration in a Bayesian framework

Calibration of a computer code

Use observations obtained from an experiment to find out the best values of coefficients in the numerical model.

It is aninverse problem.

Bayesian framework : the parameters are unknown andrandom.

They follow a probability distribution, fromprior (before seeing the

data) toposterior (after seeing the data).

(a)Direct problem

(b)Inverse problem

(8)

Calibration in a Bayesian framework

Calibration of a computer code

Use observations obtained from an experiment to find out the best values of coefficients in the numerical model.

It is aninverse problem.

Bayesian framework : the parameters are unknown andrandom.

They follow a probability distribution, fromprior (before seeing the

data) toposterior (after seeing the data).

(9)

Uncertainty sources in numerical simulations

Traditional decomposition : ([KO01])

I Parametric uncertainty : due to the imperfect knowledge of

coefficients in the model.

I Model error : due to modeling assumptions to construct the

physical model.

I Experimental uncertainty : results from inexact measurements

of quantities of interest.

I Numerical error : results from solving a physical model with

numerical methods (discrete schemes, finite elements, . . . ).

In Uncertainty Quantification studies,model erroris often not included.

In this work : How can we accurately estimatemodel errorand take it into account in the result of a computer code ?

(10)

Uncertainty sources in numerical simulations

Traditional decomposition : ([KO01])

I Parametric uncertainty : due to the imperfect knowledge of

coefficients in the model.

I Model error: due to modeling assumptions to construct the

physical model.

I Experimental uncertainty : results from inexact measurements

of quantities of interest.

I Numerical error : results from solving a physical model with

numerical methods (discrete schemes, finite elements, . . . ). In Uncertainty Quantification studies,model erroris often not included.

In this work : How can we accurately estimatemodel errorand take it into account in the result of a computer code ?

(11)

Uncertainty sources in numerical simulations

Traditional decomposition : ([KO01])

I Parametric uncertainty : due to the imperfect knowledge of

coefficients in the model.

I Model error: due to modeling assumptions to construct the

physical model.

I Experimental uncertainty : results from inexact measurements

of quantities of interest.

I Numerical error : results from solving a physical model with

numerical methods (discrete schemes, finite elements, . . . ). In Uncertainty Quantification studies,model erroris often not included.

In this work : How can we accurately estimatemodel errorand take it into account in the result of a computer code ?

(12)

Problem formulation

Calibration with model error [KO01] :

yobs(x ) = f (x , θbest) +z(x ) + exp (1) I No numerical error.

I Model error : defined as difference between reality and model taken at its best parameters.

I What is the ”best parameters” value ?

Calibration with flexible prior [Plu17] :

yobs(x ) = f (x , θ) + z(x , θ) + exp (2) I Model bias depends on model parameters.

(13)

Problem formulation

Calibration with model error [KO01] :

yobs(x ) = f (x , θbest) +z(x ) + exp (1) I No numerical error.

I Model error : defined as difference between reality and model taken at its best parameters.

I What is the ”best parameters” value ?

Calibration with flexible prior [Plu17] :

yobs(x ) = f (x , θ) + z(x , θ) + exp (2) I Model bias depends on model parameters.

(14)

Calibration problem

With previous hypotheses, the likelihood function is gaussian :

yobs|θ, ψ ∼ N(fθ,Cψ+ σexp2 In). (3)

And the full posterior distribution is given by Bayes’ Theorem : p(θ, ψ|yobs) ∝p(θ, ψ)p(yobs|θ, ψ). (4)

Equation (4) is too expensive to compute in general.

KOH approximation :

A single value of hyperparameters is estimated with maximum a posteriori :

ψMAP = arg max

ψ

p(ψ|yobs). (5)

Full Maximum Posterior approximation :

Multiple values of hyperparameters are estimated : ψFMP(θ) = arg max

ψ

(15)

Calibration problem

With previous hypotheses, the likelihood function is gaussian :

yobs|θ, ψ ∼ N(fθ,Cψ+ σexp2 In). (3)

And the full posterior distribution is given by Bayes’ Theorem : p(θ, ψ|yobs) ∝p(θ, ψ)p(yobs|θ, ψ). (4)

Equation (4) is too expensive to compute in general.

KOH approximation :

A single value of hyperparameters is estimated with maximum a posteriori :

ψMAP = arg max

ψ

p(ψ|yobs). (5)

Full Maximum Posterior approximation :

Multiple values of hyperparameters are estimated : ψFMP(θ) = arg max

ψ

(16)

Calibration problem

With previous hypotheses, the likelihood function is gaussian :

yobs|θ, ψ ∼ N(fθ,Cψ+ σexp2 In). (3)

And the full posterior distribution is given by Bayes’ Theorem : p(θ, ψ|yobs) ∝p(θ, ψ)p(yobs|θ, ψ). (4)

Equation (4) is too expensive to compute in general.

KOH approximation :

A single value of hyperparameters is estimated with maximum a posteriori :

ψMAP = arg max

ψ

p(ψ|yobs). (5)

Full Maximum Posterior approximation :

(17)

Calibration problem (cont.)

The posterior density of parameters is then estimated by :

p(θ|yobs) ∝ p(θ)p(yobs|θ, ψ = ψFMP(θ)) (7)

The model can be used for prediction at a new point x∗:

p(f (x∗)|yobs) =

Z

θ

(18)

Calibration problem (cont.)

The posterior density of parameters is then estimated by :

p(θ|yobs) ∝ p(θ)p(yobs|θ, ψ = ψFMP(θ)) (7)

The model can be used for prediction at a new point x∗:

p(f (x∗)|yobs) =

Z

θ

(19)

Algorithm for FMP calibration

Algorithm 1: FMP calibration

- Build a DoE {θi} in the model parameters space;

- Run the computer model to get {f (θi)}and perform the

optimisations to get {ψFMP(θi)}(eq. (6));

- Store the optimized values and multiply by p(θ) to get the posterior density p(θ|yobs);

- The posterior density is used to compute new predictions.

I More optimisations are required compared to traditional methods.

I Optimisations are independent and can be run in parallel.

I In this work we use a full grid sampling. Integrals are evaluated by quadrature.

(20)

Contents

Context

Model error and Calibration

Analytical example with gaussian posteriors

Numerical example Conclusion

(21)

Unimodal Gaussian Posterior

Let us assume that the joint posterior p(θ, ψ|yobs)is gaussian.

(a)Full Bayes

(b)MAP approximation(c)FMP approximation

I The FMP method is exact on this case. With traditional MAP the parameter posterior shows reduced variance (”false certitude”).

(22)

Unimodal Gaussian Posterior

Let us assume that the joint posterior p(θ, ψ|yobs)is gaussian.

(a)Full Bayes (b)MAP approximation

(c)FMP approximation

I The FMP method is exact on this case. With traditional MAP the parameter posterior shows reduced variance (”false certitude”).

(23)

Unimodal Gaussian Posterior

Let us assume that the joint posterior p(θ, ψ|yobs)is gaussian.

(a)Full Bayes (b)MAP approximation(c)FMP approximation

I The FMP method is exact on this case. With traditional MAP the parameter posterior shows reduced variance (”false certitude”).

(24)

Unimodal Gaussian Posterior

Let us assume that the joint posterior p(θ, ψ|yobs)is gaussian.

(a)Full Bayes (b)MAP approximation(c)FMP approximation

I The FMP method is exact on this case. With traditional MAP the parameter posterior shows reduced variance (”false certitude”).

(25)

Mixture of Gaussians

Suppose that p(θ, ψ|yobs)is a mixture of gaussians, well-separated.

(a)Full Bayes

(b)MAP approximation(c)FMP approximation

I Traditional MAP might not see probability mass. The estimated variance is still reduced.

I FMP approximation finds all maxima with correct variance. Peak values might be incorrect due to volume effects.

(26)

Mixture of Gaussians

Suppose that p(θ, ψ|yobs)is a mixture of gaussians, well-separated.

(a)Full Bayes (b)MAP approximation

(c)FMP approximation

I Traditional MAP might not see probability mass. The estimated variance is still reduced.

I FMP approximation finds all maxima with correct variance. Peak values might be incorrect due to volume effects.

(27)

Mixture of Gaussians

Suppose that p(θ, ψ|yobs)is a mixture of gaussians, well-separated.

(a)Full Bayes (b)MAP approximation(c)FMP approximation

I Traditional MAP might not see probability mass. The estimated variance is still reduced.

I FMP approximation finds all maxima with correct variance. Peak values might be incorrect due to volume effects.

(28)

Mixture of Gaussians

Suppose that p(θ, ψ|yobs)is a mixture of gaussians, well-separated.

(a)Full Bayes (b)MAP approximation(c)FMP approximation

I Traditional MAP might not see probability mass. The estimated variance is still reduced.

(29)

Contents

Context

Model error and Calibration

Analytical example with gaussian posteriors

Numerical example

(30)

Numerical example

1D example. ytruth(x ) = x and f (x , θ) = x sin(2θx ) + (x + 0.15)(1 − θ).

x ∈ [0, 1] and θ ∈ [−0.5, 1.5].

(31)

Predictions with the calibrated model

Confidence intervals from FMP and Bayesian predictions are large enough to contain observations.

Map predictions provide an incorrectly thin confidence interval, ” false certitude”.

(32)

Contents

Context

Model error and Calibration

Analytical example with gaussian posteriors Numerical example

(33)

Conclusion

I We solve the joint estimation problem that is overlooked in litterature because :

– it is expensive to solve

– it doesn’t match with the traditional definition of model error.

I The FMP estimation reduces the cost and is still accurate with gaussian posteriors.

I The traditional MAP estimation might miss posterior probability mass.

Perspectives :

I Application to more complex cases,

I Study of smart sampling techniques to increase the dimension of the problem.

(34)

References I

Marc C. KENNEDYet Anthony O’HAGAN.“Bayesian Calibration of Computer Models”.In : Journal of the Royal Statistical Society : Series B (Statistical Methodology) 63.3 (2001), p. 425-464.ISSN: 1467-9868.DOI:

10.1111/1467-9868.00294.URL:

https://rss.onlinelibrary.wiley.com/doi/abs/10. 1111/1467-9868.00294 (visit ´e le 14/02/2020).

Matthew PLUMLEE.Bayesian Calibration of Inexact Computer Models : Journal of the American Statistical Association : Vol 112, No 519.2017.URL:

https://www.tandfonline.com/doi/full/10.1080/ 01621459.2016.1211016 (visit ´e le 14/02/2020).

(35)

References II

Heng XIAOet Paola CINNELLA.“Quantification of Model Uncertainty in RANS Simulations : A Review”.In : Progress in Aerospace Sciences 108 (1er juil. 2019), p. 1-31.ISSN: 0376-0421.DOI: 10.1016/j.paerosci.2018.10.001.URL: http://www.sciencedirect.com/science/article/pii/ S0376042118300952 (visit ´e le 14/02/2020).

(36)

Références

Documents relatifs

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

This note shows that the asymptotic variance of Chen’s [Econometrica, 70, 4 (2002), 1683–1697] two-step estimator of the link function in a linear transformation model depends on

For the non-independent multivariate gamma models, it is then pointed out that the UMVU and the maxi- mum likelihood estimators are not proportional as conjectured for models

The vertical red solid line represents the true parameter value and the dashed black, green and blue line indicates the 50000, 100000 and 300000 iteration estimates of β

Finally, we compare the Sharpe ratios obtained by the standard mean-variance allocation and the penalized one for four dif- ferent reference portfolios: equal-weights,

The variability of these estimates is surprisingly large, however: The present simulations indicate that repeating one and the same Bayesian ANOVA on a constant dataset often results

In this paper we present a method for hypothesis testing on the diffusion coefficient, that is based upon the observation of functionals defined on regularizations of the path of

Abstract: For a large class of distributions and large samples, it is shown that estimates of the variance σ 2 and of the standard deviation σ are more often Pitman closer to