TY - JOUR
T1 - A probabilistic model for the numerical solution of initial value problems
AU - Schober, Michael
AU - Särkkä, Simo
AU - Hennig, Philipp
PY - 2019/1/15
Y1 - 2019/1/15
N2 - We study connections between ordinary differential equation (ODE) solvers and probabilistic regression methods in statistics. We provide a new view of probabilistic ODE solvers as active inference agents operating on stochastic differential equation models that estimate the unknown initial value problem (IVP) solution from approximate observations of the solution derivative, as provided by the ODE dynamics. Adding to this picture, we show that several multistep methods of Nordsieck form can be recasted as Kalman filtering on q-times integrated Wiener processes. Doing so provides a family of IVP solvers that return a Gaussian posterior measure, rather than a point estimate. We show that some such methods have low computational overhead, nontrivial convergence order, and that the posterior has a calibrated concentration rate. Additionally, we suggest a step size adaptation algorithm which completes the proposed method to a practically useful implementation, which we experimentally evaluate using a representative set of standard codes in the DETEST benchmark set.
AB - We study connections between ordinary differential equation (ODE) solvers and probabilistic regression methods in statistics. We provide a new view of probabilistic ODE solvers as active inference agents operating on stochastic differential equation models that estimate the unknown initial value problem (IVP) solution from approximate observations of the solution derivative, as provided by the ODE dynamics. Adding to this picture, we show that several multistep methods of Nordsieck form can be recasted as Kalman filtering on q-times integrated Wiener processes. Doing so provides a family of IVP solvers that return a Gaussian posterior measure, rather than a point estimate. We show that some such methods have low computational overhead, nontrivial convergence order, and that the posterior has a calibrated concentration rate. Additionally, we suggest a step size adaptation algorithm which completes the proposed method to a practically useful implementation, which we experimentally evaluate using a representative set of standard codes in the DETEST benchmark set.
KW - Filtering
KW - Gaussian processes
KW - Initial value problems
KW - Markov processes
KW - Nordsieck methods
KW - Probabilistic numerics
KW - Runge–Kutta methods
UR - http://www.scopus.com/inward/record.url?scp=85060911619&partnerID=8YFLogxK
U2 - 10.1007/s11222-017-9798-7
DO - 10.1007/s11222-017-9798-7
M3 - Article
AN - SCOPUS:85060911619
SN - 0960-3174
VL - 29
SP - 99
EP - 122
JO - STATISTICS AND COMPUTING
JF - STATISTICS AND COMPUTING
IS - 1
ER -