Probabilistic Numerics and Uncertainty in Computations
Philipp Hennig, Michael A Osborne, Mark Girolami

TL;DR
This paper advocates for probabilistic numerical methods that quantify uncertainty in computational tasks, enhancing decision-making in science and industry by interpreting classical algorithms as probabilistic inference and developing new, adaptable algorithms.
Contribution
It introduces a probabilistic framework for numerical methods, offering new algorithms with improved performance and uncertainty quantification, applicable to complex scientific problems.
Findings
Probabilistic interpretation of classical numerical algorithms.
New algorithms that adapt to specific application needs.
Demonstrated benefits on real scientific problems.
Abstract
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such uncertainties, arising from the loss of precision induced by numerical calculation with limited time or hardware, are important for much contemporary science and industry. Within applications such as climate science and astrophysics, the need to make decisions on the basis of computations with large and complex data has led to a renewed focus on the management of numerical uncertainty. We describe how several seminal classic numerical methods can be interpreted naturally as probabilistic inference. We then show that the probabilistic view suggests new algorithms that can flexibly be adapted to suit application specifics, while delivering improved…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
