A Modern Retrospective on Probabilistic Numerics

Abstract

This article attempts to place the emergence of probabilistic numerics as a mathematical-statistical research field within its historical context and to explore how its gradual development can be related both to applications and to a modern formal treatment. We highlight in particular the parallel contributions of Sul'din and Larkin in the 1960s and how their pioneering early ideas have reached a degree of maturity in the intervening period, mediated by paradigms such as average-case analysis and information-based complexity. We provide a subjective assessment of the state of research in probabilistic numerics and highlight some difficulties to be addressed by future works.

23 pages, 2 figures

References in corpus (4)

• DGM: A deep learning algorithm for solving partial differential equations
• Adaptive nonparametric confidence sets
• Fast Automatic Bayesian Cubature Using Lattice Sampling
• Random forward models and log-likelihoods in Bayesian inverse problems

Cited by in corpus (6)

• Random time step probabilistic methods for uncertainty quantification in chaotic and geometric numerical integration
• A probabilistic finite element method based on random meshes: Error estimators and Bayesian inverse problems
• Bayesian Numerical Methods for Nonlinear Partial Differential Equations
• Stochastic parareal: an application of probabilistic methods to time-parallelisation
• Randomised one-step time integration methods for deterministic operator differential equations
• Radiative Transfer as a Bayesian Linear Regression problem