43 citations · 70 across the 4 of their papers we have counts for
4 papers
Fast and Robust Shortest Paths on Manifolds Learned from Data
Georgios Arvanitidis, Søren Hauberg, Philipp Hennig +1
We propose a fast, simple and robust algorithm for computing shortest paths and distances on Riemannian manifolds learned from data. This amounts to solving a system of ordinary di…
Bayesian Filtering for ODEs with Bounded Derivatives
Emilia Magnani, Hans Kersting, Michael Schober +1
Recently there has been increasing interest in probabilistic solvers for ordinary differential equations (ODEs) that return full probability measures, instead of point estimates, o…
A probabilistic model for the numerical solution of initial value problems
Michael Schober, Simo Särkkä, Philipp Hennig
Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tracta…
Probabilistic ODE Solvers with Runge-Kutta Means
Michael Schober, David Duvenaud, Philipp Hennig
Runge-Kutta methods are the classic family of solvers for ordinary differential equations (ODEs), and the basis for the state of the art. Like most numerical methods, they return p…