mlsanityData to 13 Oct 2026

Differentiable Likelihoods for Fast Inversion of 'Likelihood-Free' Dynamical Systems

arXiv 2002.09301 ↗First posted 21 Feb 2020stat.ML cs.LG cs.NAcited by 14

Not on the map. Why?

Abstract (arXiv)

Likelihood-free (a.k.a. simulation-based) inference problems are inverse problems with expensive, or intractable, forward models. ODE inverse problems are commonly treated as likelihood-free, as their forward map has to be numerically approximated by an ODE solver. This, however, is not a fundamental constraint but just a lack of functionality in classic ODE solvers, which do not return a likelihood but a point estimate. To address this shortcoming, we employ Gaussian ODE filtering (a probabilistic numerical method for ODEs) to construct a local Gaussian approximation to the likelihood. This approximation yields tractable estimators for the gradient and Hessian of the (log-)likelihood. Insertion of these estimators into existing gradient-based optimization and sampling methods engenders new solvers for ODE inverse problems. We demonstrate that these methods outperform standard likelihood-free approaches on three benchmark-systems.

Key facts. Cited by 14 papers in the map (data through 13 Oct 2026). First posted on arXiv 21 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2021: 5; 2022: 1; 2023: 5; 2024: 1; 2025: 1; 2026: 1.

14 papers.

Sort:

By area: