Browsing by Author "Yaghoobi, Fatemeh"
Now showing 1 - 2 of 2
- Results Per Page
- Sort Options
- Parallel-in-Time Probabilistic Numerical ODE Solvers
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä(2024-07-24) Bosch, Nathanael; Corenflos, Adrien; Yaghoobi, Fatemeh; Tronarp, Filip; Hennig, Philipp; Särkkä, SimoProbabilistic numerical solvers for ordinary differential equations (ODEs) treat the numerical simulation of dynamical systems as problems of Bayesian state estimation. Aside from producing posterior distributions over ODE solutions and thereby quantifying the numerical approximation error of the method itself, one less-often noted advantage of this formalism is the algorithmic flexibility gained by formulating numerical simulation in the framework of Bayesian filtering and smoothing. In this paper, we leverage this flexibility and build on the time-parallel formulation of iterated extended Kalman smoothers to formulate a parallel-in-time probabilistic numerical ODE solver. Instead of simulating the dynamical system sequentially in time, as done by current probabilistic solvers, the proposed method processes all time steps in parallel and thereby reduces the computational complexity from linear to logarithmic in the number of time steps. We demonstrate the effectiveness of our approach on a variety of ODEs and compare it to a range of both classic and probabilistic numerical ODE solvers. - A Recursive Newton Method for Smoothing in Nonlinear State Space Models
A4 Artikkeli konferenssijulkaisussa(2023) Yaghoobi, Fatemeh; Abdulsamad, Hany; Särkkä, SimoIn this paper, we use the optimization formulation of nonlinear Kalman filtering and smoothing problems to develop second-order variants of iterated Kalman smoother (IKS) methods. We show that Newton's method corresponds to a recursion over affine smoothing problems on a modified state-space model augmented by a pseudo measurement. The first and second derivatives required in this approach can be efficiently computed with widely available automatic differentiation tools. Furthermore, we show how to incorporate line-search and trust-region strategies into the proposed second-order IKS algorithm in order to regularize updates between iterations. Finally, we provide numerical examples to demonstrate the method's efficiency in terms of runtime compared to its batch counterpart.