A probabilistic model for the numerical solution of initial value problems. Michael Schober, Simo Särkkä, & Philipp Hennig arXiv, October, 2016.
A probabilistic model for the numerical solution of initial value problems [link]Paper  abstract   bibtex   
Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tractable computations as inputs. This structure is closely connected to the notion of inference on latent variables in statistics. We describe a class of algorithms that formulate the solution to an IVP as inference on a latent path that is a draw from a Gaussian process probability measure (or equivalently, the solution of a linear stochastic differential equation). We then show that certain members of this class are identified exactly with existing generalized linear methods for ODEs, in particular a number of Runge–Kutta methods and Nordsieck methods. This probabilistic formulation of classic methods is valuable in two ways: analytically, it highlights implicit prior assumptions favoring certain approximate solutions to the IVP over others, and gives a precise meaning to the old observation that these methods act like filters. Practically, it endows the classic solvers with `docking points' for notions of uncertainty and prior information about the initial value, the value of the ODE itself, and the solution of the problem.
@article{michael_schober_probabilistic_2016,
	title = {A probabilistic model for the numerical solution of initial value problems},
	url = {https://arxiv.org/abs/1610.05261},
	abstract = {Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tractable computations as inputs. This structure is closely connected to the notion of inference on latent variables in statistics. We describe a class of algorithms that formulate the solution to an IVP as inference on a latent path that is a draw from a Gaussian process probability measure (or equivalently, the solution of a linear stochastic differential equation). We then show that certain members of this class are identified exactly with existing generalized linear methods for ODEs, in particular a number of Runge--Kutta methods and Nordsieck methods. This probabilistic formulation of classic methods is valuable in two ways: analytically, it highlights implicit prior assumptions favoring certain approximate solutions to the IVP over others, and gives a precise meaning to the old observation that these methods act like filters. Practically, it endows the classic solvers with `docking points' for notions of uncertainty and prior information about the initial value, the value of the ODE itself, and the solution of the problem.},
	journal = {arXiv},
	author = {{Michael Schober} and {Simo Särkkä} and {Philipp Hennig}},
	month = oct,
	year = {2016},
	keywords = {machine learning, numerical analysis, uses sympy},
}
Downloads: 0