Bayesian Solution Uncertainty Quantification for Differential Equations
File(s)euclid.ba.1473276259.pdf (2.06 MB)
Published version
Author(s)
Chkrebtii, OA
Campbell, DA
Calderhead, B
Girolami, MA
Type
Journal Article
Abstract
We explore probability modelling of discretization uncertainty for system
states defined implicitly by ordinary or partial differential equations. Accounting
for this uncertainty can avoid posterior under-coverage when likelihoods are
constructed from a coarsely discretized approximation to system equations. A formalism
is proposed for inferring a fixed but a priori unknown model trajectory
through Bayesian updating of a prior process conditional on model information.
A one-step-ahead sampling scheme for interrogating the model is described, its
consistency and first order convergence properties are proved, and its computational
complexity is shown to be proportional to that of numerical explicit one-step
solvers. Examples illustrate the flexibility of this framework to deal with a wide
variety of complex and large-scale systems. Within the calibration problem, discretization
uncertainty defines a layer in the Bayesian hierarchy, and a Markov
chain Monte Carlo algorithm that targets this posterior distribution is presented.
This formalism is used for inference on the JAK-STAT delay differential equation
model of protein dynamics from indirectly observed measurements. The discussion
outlines implications for the new field of probabilistic numerics.
states defined implicitly by ordinary or partial differential equations. Accounting
for this uncertainty can avoid posterior under-coverage when likelihoods are
constructed from a coarsely discretized approximation to system equations. A formalism
is proposed for inferring a fixed but a priori unknown model trajectory
through Bayesian updating of a prior process conditional on model information.
A one-step-ahead sampling scheme for interrogating the model is described, its
consistency and first order convergence properties are proved, and its computational
complexity is shown to be proportional to that of numerical explicit one-step
solvers. Examples illustrate the flexibility of this framework to deal with a wide
variety of complex and large-scale systems. Within the calibration problem, discretization
uncertainty defines a layer in the Bayesian hierarchy, and a Markov
chain Monte Carlo algorithm that targets this posterior distribution is presented.
This formalism is used for inference on the JAK-STAT delay differential equation
model of protein dynamics from indirectly observed measurements. The discussion
outlines implications for the new field of probabilistic numerics.
Date Issued
2016-12-01
Date Acceptance
2016-09-01
Citation
Bayesian Analysis, 2016, 11 (4), pp.1239-1267
ISSN
1936-0975
Publisher
International Society for Bayesian Analysis
Start Page
1239
End Page
1267
Journal / Book Title
Bayesian Analysis
Volume
11
Issue
4
Copyright Statement
© 2016 International Society for Bayesian Analysis.
Identifier
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000396686600003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=1ba7043ffcc86c417c072aa74d649202
Subjects
Science & Technology
Physical Sciences
Mathematics, Interdisciplinary Applications
Statistics & Probability
Mathematics
Bayesian numerical analysis
uncertainty quantification
Gaussian processes
differential equation models
uncertainty in computer models
PARAMETER-ESTIMATION
INVERSE PROBLEMS
MODEL-REDUCTION
LIKELIHOOD
ERROR
stat.ME
stat.ME
Statistics & Probability
0104 Statistics
Publication Status
Published
Date Publish Online
2016-09-07