paper-with-me

Papers

Calibrated Adaptive Probabilistic ODE Solvers

2020-12-15 · Nathanael Bosch, Philipp Hennig, Filip Tronarp

Probabilistic solvers for ordinary differential equations assign a posterior measure to the solution of an initial value problem. The joint covariance of this distribution provides an estimate of the (global) approximation error. The contraction rate of this error estimate as a function of the solver's step size identifies it as a well-calibrated worst-case error, but its explicit numerical value for a certain step size is not automatically a good estimate of the explicit error. Addressing this issue, we introduce, discuss, and assess several probabilistically motivated ways to calibrate the uncertainty estimate. Numerical experiments demonstrate that these calibration methods interact efficiently with adaptive step-size selection, resulting in descriptive, and efficiently computable posteriors. We demonstrate the efficiency of the methodology by benchmarking against the classic, widely used Dormand-Prince 4/5 Runge-Kutta method.

📄 PDF Abstract BibTeX arXiv:2012.08202

Code (1)

nathanaelbosch/capos 공식 구현

Tasks

BenchmarkingDescriptive

Similar Papers 제목 키워드 기반

Adaptive Probabilistic ODE Solvers Without Adaptive Memory Requirements

2024-10-14 · Nicholas Krämer

Despite substantial progress in recent years, probabilistic solvers with adaptive step sizes can still not solve memory-demanding differential equations -- unless we care only about a single point in time (which is far t…

State EstimationTime Series

Active Uncertainty Calibration in Bayesian ODE Solvers

2016-05-11 · Hans Kersting, Philipp Hennig

There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al. introduced a sam…

Calibrated Computation-Aware Gaussian Processes

2024-10-11 · Disha Hegde, Mohamed Adil, Jon Cockayne

Gaussian processes are notorious for scaling cubically with the size of the training set, preventing application to very large regression problems. Computation-aware Gaussian processes (CAGPs) tackle this scaling issue b…

Gaussian ProcessesregressionUncertainty Quantification

Data-Adaptive Probabilistic Likelihood Approximation for Ordinary Differential Equations

2023-06-08 · Mohan Wu, Martin Lysy

Estimating the parameters of ordinary differential equations (ODEs) is of fundamental importance in many scientific applications. While ODEs are typically approximated with deterministic algorithms, new research on proba…

Affine Tracing: A New Paradigm for Probabilistic Linear Solvers

2026-05-11 · Disha Hegde, Marvin Pförtner, Jon Cockayne arxiv

Probabilistic linear solvers (PLSs) return probability distributions that quantify uncertainty due to limited computation in the solution of linear systems. The literature has traditionally distinguished between Bayesian…