Black Box Probabilistic Numerics
- URL: http://arxiv.org/abs/2106.13718v1
- Date: Tue, 15 Jun 2021 11:21:10 GMT
- Title: Black Box Probabilistic Numerics
- Authors: Onur Teymur, Christopher N. Foley, Philip G. Breen, Toni Karvonen,
Chris. J. Oates
- Abstract summary: This paper proposes to construct probabilistic numerical methods based only on the final output from a traditional method.
A convergent sequence of approximations to the quantity of interest constitute a dataset.
This black box approach massively expands the range of tasks to which probabilistic numerics can be applied.
- Score: 7.6034684297555
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Probabilistic numerics casts numerical tasks, such the numerical solution of
differential equations, as inference problems to be solved. One approach is to
model the unknown quantity of interest as a random variable, and to constrain
this variable using data generated during the course of a traditional numerical
method. However, data may be nonlinearly related to the quantity of interest,
rendering the proper conditioning of random variables difficult and limiting
the range of numerical tasks that can be addressed. Instead, this paper
proposes to construct probabilistic numerical methods based only on the final
output from a traditional method. A convergent sequence of approximations to
the quantity of interest constitute a dataset, from which the limiting quantity
of interest can be extrapolated, in a probabilistic analogue of Richardson's
deferred approach to the limit. This black box approach (1) massively expands
the range of tasks to which probabilistic numerics can be applied, (2) inherits
the features and performance of state-of-the-art numerical methods, and (3)
enables provably higher orders of convergence to be achieved. Applications are
presented for nonlinear ordinary and partial differential equations, as well as
for eigenvalue problems-a setting for which no probabilistic numerical methods
have yet been developed.
Related papers
- Probabilistic Numeric SMC Sampling for Bayesian Nonlinear System Identification in Continuous Time [0.0]
In engineering, accurately modeling nonlinear dynamic systems from data contaminated by noise is both essential and complex.
The integration of continuous-time ordinary differential equations (ODEs) is crucial for aligning theoretical models with discretely sampled data.
This paper demonstrates the application of a probabilistic numerical method for solving ODEs in the joint parameter-state identification of nonlinear dynamic systems.
arXiv Detail & Related papers (2024-04-19T14:52:14Z) - Deep Ensembles Meets Quantile Regression: Uncertainty-aware Imputation
for Time Series [49.992908221544624]
Time series data often exhibit numerous missing values, which is the time series imputation task.
Previous deep learning methods have been shown to be effective for time series imputation.
We propose a non-generative time series imputation method that produces accurate imputations with inherent uncertainty.
arXiv Detail & Related papers (2023-12-03T05:52:30Z) - Probabilistic Exponential Integrators [36.98314810594263]
Like standard solvers, they suffer performance penalties for certain stiff systems.
This paper develops a class of probabilistic exponential solvers with favorable properties.
We evaluate the proposed methods on multiple stiff differential equations.
arXiv Detail & Related papers (2023-05-24T10:13:13Z) - Monte Carlo Neural PDE Solver for Learning PDEs via Probabilistic Representation [59.45669299295436]
We propose a Monte Carlo PDE solver for training unsupervised neural solvers.
We use the PDEs' probabilistic representation, which regards macroscopic phenomena as ensembles of random particles.
Our experiments on convection-diffusion, Allen-Cahn, and Navier-Stokes equations demonstrate significant improvements in accuracy and efficiency.
arXiv Detail & Related papers (2023-02-10T08:05:19Z) - Learning to Bound Counterfactual Inference in Structural Causal Models
from Observational and Randomised Data [64.96984404868411]
We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm.
The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources.
It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
arXiv Detail & Related papers (2022-12-06T12:42:11Z) - Reliability analysis of discrete-state performance functions via
adaptive sequential sampling with detection of failure surfaces [0.0]
The paper presents a new efficient and robust method for rare event probability estimation.
The method can estimate the probabilities of multiple failure types.
It can accommodate this information to increase the accuracy of the estimated probabilities.
arXiv Detail & Related papers (2022-08-04T05:59:25Z) - An Application of a Multivariate Estimation of Distribution Algorithm to
Cancer Chemotherapy [59.40521061783166]
Chemotherapy treatment for cancer is a complex optimisation problem with a large number of interacting variables and constraints.
We show that the more sophisticated algorithm would yield better performance on a complex problem like this.
We hypothesise that this is caused by the more sophisticated algorithm being impeded by the large number of interactions in the problem.
arXiv Detail & Related papers (2022-05-17T15:28:46Z) - ProbNum: Probabilistic Numerics in Python [62.52335490524408]
Probabilistic numerical methods (PNMs) solve numerical problems via probabilistic inference.
We present ProbNum: a Python library providing state-of-the-art PNMs.
arXiv Detail & Related papers (2021-12-03T07:20:50Z) - Asymptotically Exact and Fast Gaussian Copula Models for Imputation of
Mixed Data Types [0.13764085113103217]
Missing values with mixed data types is a common problem in a large number of machine learning applications.
Gustafson copula models have been suggested as a means of performing imputation of missing values using a probabilistic framework.
We address the first limitation using direct and arbitrarily precise approximations both for model estimation and imputation by using randomized quasi-Monte Carlo procedures.
arXiv Detail & Related papers (2021-02-04T14:42:29Z) - Stable Implementation of Probabilistic ODE Solvers [27.70274403550477]
Probabilistic solvers for ordinary differential equations (ODEs) provide efficient quantification of numerical uncertainty.
They suffer from numerical instability when run at high order or with small step-sizes.
The present work proposes and examines a solution to this problem.
It involves three components: accurate initialisation, a coordinate change preconditioner that makes numerical stability concerns step-size-independent, and square-root implementation.
arXiv Detail & Related papers (2020-12-18T08:35:36Z) - Marginal likelihood computation for model selection and hypothesis
testing: an extensive review [66.37504201165159]
This article provides a comprehensive study of the state-of-the-art of the topic.
We highlight limitations, benefits, connections and differences among the different techniques.
Problems and possible solutions with the use of improper priors are also described.
arXiv Detail & Related papers (2020-05-17T18:31:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.