Bayesian ODE solvers: the maximum a posteriori estimate

被引:25
作者
Tronarp, Filip [1 ]
Sarkka, Simo [2 ]
Hennig, Philipp [1 ,3 ]
机构
[1] Univ Tubingen, Tubingen, Germany
[2] Aalto Univ, Espoo, Finland
[3] MPI Intelligent Syst, Tubingen, Germany
基金
欧洲研究理事会; 芬兰科学院;
关键词
Probabilistic numerical methods; Maximum a posteriori estimation; Kernel methods; KALMAN SMOOTHER;
D O I
10.1007/s11222-021-09993-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
There is a growing interest in probabilistic numerical solutions to ordinary differential equations. In this paper, the maximum a posteriori estimate is studied under the class of nu times differentiable linear time-invariant Gauss-Markov priors, which can be computed with an iterated extended Kalman smoother. The maximum a posteriori estimate corresponds to an optimal interpolant in the reproducing kernel Hilbert space associated with the prior, which in the present case is equivalent to a Sobolev space of smoothness nu +1. Subject to mild conditions on the vector field, convergence rates of the maximum a posteriori estimate are then obtained via methods from nonlinear analysis and scattered data approximation. These results closely resemble classical convergence results in the sense that a nu times differentiable prior process obtains a global order of nu, which is demonstrated in numerical examples.
引用
收藏
页数:18
相关论文
共 66 条
[1]  
Adams R., 2003, SOBOLEV SPACES
[2]  
[Anonymous], 1961, J. Basic Eng, DOI [10.1115/1.3658902, DOI 10.1115/1.3658902]
[3]   An extension of a bound for functions in Sobolev spaces, with applications to (m, s)-spline interpolation and smoothing [J].
Arcangeli, Remi ;
Cruz Lopez de Silanes, Maria ;
Jose Torrens, Juan .
NUMERISCHE MATHEMATIK, 2007, 107 (02) :181-211
[4]  
Arnold V. I., 1992, Ordinary Differential Equations, V3rd
[5]   Discrete-Time Solutions to the Continuous-Time Differential Lyapunov Equation With Applications to Kalman Filtering [J].
Axelsson, Patrik ;
Gustafsson, Fredrik .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2015, 60 (03) :632-643
[6]   THE ITERATED KALMAN SMOOTHER AS A GAUSS-NEWTON METHOD [J].
BELL, BM .
SIAM JOURNAL ON OPTIMIZATION, 1994, 4 (03) :626-636
[7]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[8]  
Butcher J.C., 2008, Numerical Methods for Ordinary Differential Equations, DOI DOI 10.1002/9780470753767
[9]  
Calderhead B, ADV NEURAL INFORM PR
[10]   Bayesian Solution Uncertainty Quantification for Differential Equations [J].
Cockayne, Jon .
BAYESIAN ANALYSIS, 2016, 11 (04) :1290-1291