# Probabilistic numerics

Probabilistic numerics is a scientific field at the intersection of statistics, machine learning and applied mathematics, where tasks in numerical analysis including finding numerical solutions for integration, linear algebra, optimisation and differential equations are seen as problems of statistical, probabilistic, or Bayesian inference.[1][2][3][4]

## Introduction

A numerical method is an algorithm that approximates the solution to a mathematical problem (examples below include the solution to a linear system of equations, the value of an integral, the solution of a differential equation, the minimum of a multivariate function). In a probabilistic numerical algorithm, this process of approximation is thought of as a problem of estimation, inference or learning and realised in the framework of probabilistic inference (often, but not always, Bayesian inference).[5]

Formally, this means casting the setup of the computational problem in terms of a prior distribution, formulating the relationship between numbers computed by the computer (e.g. matrix-vector multiplications in linear algebra, gradients in optimization, values of the integrand or the vector field defining a differential equation) and the quantity in question (the solution of the linear problem, the minimum, the integral, the solution curve) in a likelihood function, and returning a posterior distribution as the output. In most cases, numerical algorithms also take internal adaptive decisions about which numbers to compute, which form an active learning problem.

Many of the most popular classic numerical algorithms can be re-interpreted in the probabilistic framework. This includes the method of conjugate gradients,[6][7][8] Nordsieck methods, Gaussian quadrature rules,[9] and Quasi-Newton methods.[10] In all these cases, the classic method is based on a regularized least-squares estimate that can be associated with the posterior mean arising from a Gaussian prior and likelihood. In such cases, the variance of the Gaussian posterior is then associated with a worst-case estimate for the squared error.

Probabilistic numerical methods promise several conceptual advantages over classic, point-estimate based approximation techniques:

• They return structured error estimates (in particular, the ability to return joint posterior samples, i.e. multiple realistic hypotheses for the true unknown solution of the problem)
• Hierarchical Bayesian inference can be used to set and control internal hyperparameters in such methods in a generic fashion, rather than having to re-invent novel methods for each parameter
• Since they use and allow for an explicit likelihood describing the relationship between computed numbers and target quantity, probabilistic numerical methods can use the results of even highly imprecise, biased and stochastic computations.[11] Conversely, probabilistic numerical methods can also provide a likelihood in computations often considered "likelihood-free" elsewhere[12]
• Because all probabilistic numerical methods use essentially the same data type – probability measures – to quantify uncertainty over both inputs and outputs they can be chained together to propagate uncertainty across large-scale, composite computations
• Sources from multiple sources of information (e.g. algebraic, mechanistic knowledge about the form of a differential equation, and observations of the trajectory of the system collected in the physical world) can be combined naturally and inside the inner loop of the algorithm, removing otherwise necessary nested loops in computation, e.g. in inverse problems.[13]

These advantages are essentially the equivalent of similar functional advantages that Bayesian methods enjoy over point-estimates in machine learning, applied or transferred to the computational domain.

### Integration

Bayesian quadrature with a Gaussian process conditioned on ${\displaystyle n=0,3,\ {\text{and}}\ 8}$ evaluations of the integrand (shown in black). Shaded areas in the left column illustrate the marginal standard deviations. The right figure shows the prior (${\displaystyle n=0}$) and posterior (${\displaystyle n=3,8}$) Gaussian distribution over the value of the integral, as well as the true solution.

Probabilistic numerical methods have been developed for the problem of numerical integration, with the most popular method called Bayesian quadrature.[14][15][16][17]

In numerical integration, function evaluations ${\displaystyle f(x_{1}),\ldots ,f(x_{n})}$ at a number of points ${\displaystyle x_{1},\ldots ,x_{n}}$ are used to estimate the integral ${\displaystyle \textstyle \int f(x)\nu (dx)}$ of a function ${\displaystyle f}$ against some measure ${\displaystyle \nu }$. Bayesian quadrature consists of specifying a prior distribution over ${\displaystyle f}$ and conditioning this prior on ${\displaystyle f(x_{1}),\ldots ,f(x_{n})}$ to obtain a posterior distribution over ${\displaystyle f}$, then computing the implied posterior distribution on ${\displaystyle \textstyle \int f(x)\nu (dx)}$. The most common choice of prior is a Gaussian process as this allows us to obtain a closed-form posterior distribution on the integral which is a univariate Gaussian distribution. Bayesian quadrature is particularly useful when the function ${\displaystyle f}$ is expensive to evaluate and the dimension of the data is small to moderate.

### Optimization

Bayesian optimization of a function (black) with Gaussian processes (purple). Three acquisition functions (blue) are shown at the bottom.[18]

Probabilistic approaches have also been studied for mathematical optimization, which consist of finding the minimum of maximum of some objective function ${\displaystyle f}$ given (possibly noisy or indirect) evaluations of that function at a set of points.

Perhaps the most notable effort in this direction is Bayesian optimization,[19] a general approach to optimization grounded in Bayesian inference. Bayesian optimization algorithms operate by maintaining a probabilistic belief about ${\displaystyle f}$ throughout the optimization procedure; this often takes the form of a Gaussian process prior conditioned on observations. This belief then guides the algorithm in obtaining observations that are likely to advance the optimization process. Bayesian optimization policies are usually realized by transforming the objective function posterior into an inexpensive, differentiable acquisition function that is maximized to select each successive observation location. One prominent approach is to model optimization via Bayesian sequential experimental design, seeking to obtain a sequence of observations yielding the most optimization progress as evaluated by an appropriate utility function. A welcome side effect from this approach is that uncertainty in the objective function, as measured by the underlying probabilistic belief, can guide an optimization policy in addressing the classic exploration vs. exploitation tradeoff.

### Local Optimization

Probabilistic numerical methods have been developed in the context of stochastic optimization for deep learning, in particular to address main issues such as learning rate tuning and line searches,[20] batch-size selection,[21] early stopping,[22] pruning,[23] and first- and second-order search directions.[24][25]

In this setting, the optimization objective is often an empirical risk of the form ${\displaystyle \textstyle L(\theta )={\frac {1}{N}}\sum _{n=1}^{N}\ell (y_{n},f_{\theta }(x_{n}))}$ defined by a dataset ${\displaystyle \textstyle {\mathcal {D}}=\{(x_{n},y_{n})\}_{n=1}^{N}}$, and a loss ${\displaystyle \ell (y,f_{\theta }(x))}$ that quantifies how well a predictive model ${\displaystyle f_{\theta }(x)}$ parameterized by ${\displaystyle \theta }$ performs on predicing the target ${\displaystyle y}$ from its corresponding input ${\displaystyle x}$ . Epistemic uncertainty arises when the dataset size ${\displaystyle N}$ is large and cannot be processed at once meaning that local quantities (given some ${\displaystyle \theta }$) such as the loss function ${\displaystyle L(\theta )}$ itself or its gradient ${\displaystyle \nabla L(\theta )}$ cannot be computed in reasonable time. Hence, generally mini-batching is used to construct estimators of these quantities on a random subset of the data. Probabilistic numerical methods model this uncertainty explicitly and allow for automated decisions and parameter tuning.

### Linear algebra

Probabilistic numerical methods for linear algebra[6] [7] [26] [8] [27] [28] have primarily focused on solving systems of linear equations of the form ${\displaystyle Ax=b}$ and the computation of determinants ${\displaystyle |A|}$.[29][30]

Illustration of a matrix-based probabilistic linear solver.

A large class of methods are iterative in nature and collect information about the linear system to be solved via repeated matrix-vector multiplication ${\displaystyle v\mapsto Av}$ with the system matrix ${\displaystyle A}$ with different vectors ${\displaystyle v}$. Such methods can be roughly split into a solution-[7][27] and a matrix-based perspective,[6][8] depending on whether belief is expressed over the solution ${\displaystyle x}$ of the linear system or the (pseudo-)inverse of the matrix ${\displaystyle H=A^{\dagger }}$. The belief update uses that the inferred object is linked to matrix multiplications ${\displaystyle y=Av}$ or ${\displaystyle z=A^{\intercal }v}$ via ${\displaystyle b^{\intercal }z=x^{\intercal }v}$ and ${\displaystyle v=A^{-1}y}$. Methods typically assume a Gaussian distribution, due to its closedness under linear observations of the problem. While conceptually different, these two views are computationally equivalent and inherently connected via the right-hand-side through ${\displaystyle x=A^{-1}b}$.[26]

The inference on determinants is also based on matrix-vector multiplications. Unlike probabilistic linear solvers, these algorithms tend to return credible intervals rather than probability distributions over the determinant.

### Ordinary differential equations

Samples from the first component of the numerical solution of the Lorenz system obtained with a probabilistic numerical integrator.[31]

Probabilistic numerical methods for ordinary differential equations ${\displaystyle {\dot {y}}(t)=f(t,y(t))}$, have been developed for initial and boundary value problems. Many different probabilistic numerical methods designed for ordinary differential equations have been proposed, and these can broadly be grouped into the two following categories:

• Randomisation-based methods are defined through random perturbations of standard deterministic numerical methods for ordinary differential equations. For example, this has been achieved by adding Gaussian perturbations on the solution of one-step integrators[31] or by perturbing randomly their time-step.[32] This defines a probability measure on the solution of the differential equation that can be sampled.
• Gaussian process regression methods are based on posing the problem of solving the differential equation at hand as a Gaussian process regression problem, interpreting evaluations of the right-hand side as data on the derivative[33]. These techniques resemble to Bayesian cubature, but employ different and often non-linear observation models[34][35]. In its infancy, this class of methods was based on naive Gaussian process regression. This was later improved (in terms of efficient computation) in favor of Gauss–Markov priors[36][37] modeled by the stochastic differential equation ${\displaystyle \mathrm {d} x(t)=Ax(t)\,\mathrm {d} t+B\,\mathrm {d} v(t)}$, where ${\displaystyle x(t)}$ is a ${\displaystyle \nu }$-dimensional vector modeling the first ${\displaystyle \nu }$ derivatives of ${\displaystyle y(t)}$, and where ${\displaystyle v(t)}$ is a ${\displaystyle \nu }$-dimensional Brownian motion. Inference can thus be implemented efficiently with Kalman filtering based methods.

The boundary between these two categories is not sharp, indeed a Gaussian process regression approach based on randomised data was developed as well[38]. These methods have been applied to problems in computational Riemannian geometry[39], inverse problems, latent force models, and to differential equations with a geometric structure such as symplecticity.

### Partial differential equations

A number of probabilistic numerical methods have also been proposed for partial differential equations. As with ordinary differential equations, the approaches can broadly be divided into those based on randomisation, generally of some underlying finite-element mesh[31][40] and those based on Gaussian process regression.[3][4][41]

## History and related fields

The interplay between numerical analysis and probability is touched upon by a number of other areas of mathematics, including average-case analysis of numerical methods, information-based complexity, game theory, and statistical decision theory. Precursors to what is now being called "probabilistic numerics" can be found as early as the late 19th and early 20th century.

The origins of probabilistic numerics can be traced to a discussion of probabilistic approaches to polynomial interpolation by Henri Poincaré in his Calcul des Probabilités.[42] In modern terminology, Poincaré considered a Gaussian prior distribution on a function ${\displaystyle f\colon \mathbb {R} \to \mathbb {R} }$, expressed as a formal power series with random coefficients, and asked for "probable values" of ${\displaystyle f(x)}$ given this prior and ${\displaystyle n\in \mathbb {N} }$ observations ${\displaystyle f(a_{i})=B_{i}}$ for ${\displaystyle i=1,\dots ,n}$.

A later seminal contribution to the interplay of numerical analysis and probability was provided by Albert Suldin in the context of univariate quadrature.[43] The statistical problem considered by Suldin was the approximation of the definite integral ${\displaystyle \textstyle \int u(t)\,\mathrm {d} t}$ of a function ${\displaystyle u\colon [a,b]\to \mathbb {R} }$, under a Brownian motion prior on ${\displaystyle u}$, given access to pointwise evaluation of ${\displaystyle u}$ at nodes ${\displaystyle t_{1},\dots ,t_{n}\in [a,b]}$. Suldin showed that, for given quadrature nodes, the quadrature rule with minimal mean squared error is the trapezoidal rule; furthermore, this minimal error is proportional to the sum of cubes of the inter-node spacings. As a result, one can see the trapezoidal rule with equally-spaced nodes as statistically optimal in some sense — an early example of the average-case analysis of a numerical method. Suldin's point of view was later extended by Mike Larkin.[44] Note that Suldin's Brownian motion prior on the integrand ${\displaystyle u}$ is a Gaussian measure and that the operations of integration and of point wise evaluation of ${\displaystyle u}$ are both linear maps. Thus, the definite integral ${\displaystyle \textstyle \int u(t)\,\mathrm {d} t}$ is a real-valued Gaussian random variable. In particular, after conditioning on the observed pointwise values of ${\displaystyle u}$, it follows a normal distribution with mean equal to the trapezoidal rule and variance equal to ${\displaystyle \textstyle {\frac {1}{12}}\sum _{i=2}^{n}(t_{i}-t_{i-1})^{3}}$. This viewpoint is very close to that of Bayesian quadrature, seeing the output of a quadrature method not just as a point estimate but as a probability distribution in its own right.

As noted by Owhadi and collaborators,[4][45] interplays between numerical approximation and statistical inference can also be traced back to Palasti and Renyi,[46] Sard,[47] Kimeldorf and Wahba[48] (on the correspondence between Bayesian estimation and spline smoothing/interpolation) and Larkin[44] (on the correspondence between Gaussian process regression and numerical approximation). Although the approach of modelling a perfectly known function as a sample from a random process may seem counterintuitive, a natural framework for understanding it can be found in information-based complexity (IBC),[49] the branch of computational complexity founded on the observation that numerical implementation requires computation with partial information and limited resources. In IBC, the performance of an algorithm operating on incomplete information can be analyzed in the worst-case or the average-case (randomized) setting with respect to the missing information. Moreover, as Packel[50] observed, the average case setting could be interpreted as a mixed strategy in an adversarial game obtained by lifting a (worst-case) minmax problem to a minmax problem over mixed (randomized) strategies. This observation leads to a natural connection[51][4] between numerical approximation and Wald's decision theory, evidently influenced by von Neumann's theory of games. To describe this connection consider the optimal recovery setting of Micchelli and Rivlin[52] in which one tries to approximate an unknown function from a finite number of linear measurements on that function. Interpreting this optimal recovery problem as a zero-sum game where Player I selects the unknown function and Player II selects its approximation, and using relative errors in a quadratic norm to define losses, Gaussian priors emerge[4] as optimal mixed strategies for such games, and the covariance operator of the optimal Gaussian prior is determined by the quadratic norm used to define the relative error of the recovery.

## Software

• ProbNum: Probabilistic Numerics in Python.
• ProbNumDiffEq.jl: Probabilistic numerical ODE solvers based on filtering implemented in Julia.
• Emukit: Adaptable Python toolbox for decision-making under uncertainty.
• BackPACK: Built on top of PyTorch. It efficiently computes quantities other than the gradient.

## References

1. ^ Hennig, P.; Osborne, M. A.; Girolami, M. (2015). "Probabilistic numerics and uncertainty in computations". Proc. A. 471 (2179): 20150142, 17. arXiv:1506.01326. Bibcode:2015RSPSA.47150142H. doi:10.1098/rspa.2015.0142. PMC 4528661. PMID 26346321.
2. ^ Oates, C. J.; Sullivan, T. J. (2019). "A modern retrospective on probabilistic numerics". Stat. Comput. 29 (6): 1335–1351. arXiv:1901.04457. doi:10.1007/s11222-019-09902-z. S2CID 67885786.
3. ^ a b Owhadi, Houman (2015). "Bayesian Numerical Homogenization". Multiscale Modeling & Simulation. 13 (3): 812–828. doi:10.1137/140974596. ISSN 1540-3459. S2CID 7245255.
4. Owhadi, Houman; Scovel, Clint (2019). Operator-Adapted Wavelets, Fast Solvers, and Numerical Homogenization: From a Game Theoretic Approach to Numerical Approximation and Algorithm Design. Cambridge Monographs on Applied and Computational Mathematics. Cambridge: Cambridge University Press. ISBN 978-1-108-48436-7.
5. ^ Cockayne, J.; Oates, C. J.; Sullivan, T. J.; Girolami, M. (2019). "Bayesian probabilistic numerical methods" (PDF). SIAM Review. 61 (4): 756–789. doi:10.1137/17M1139357. S2CID 14696405.
6. ^ a b c Hennig, P. (2015). "Probabilistic interpretation of linear solvers". SIAM Journal on Optimization. 25 (1): 2347–260. arXiv:1402.2058. doi:10.1137/140955501. S2CID 16121233.
7. ^ a b c Cockayne, J.; Oates, C.; Ipsen, I.; Girolami, M. (2019). "A Bayesian conjugate gradient method". Bayesian Analysis. International Society for Bayesian Analysis. 14 (3): 937–1012. doi:10.1214/19-BA1145. S2CID 12460125.
8. ^ a b c Wenger, J.; Hennig, P. (2020). Probabilistic Linear Solvers for Machine Learning (PDF). Advances in Neural Information Processing Systems. Vol. 33. pp. 6731–6742.
9. ^ Karvonen, Toni; Särkkä, Simo (2017). Classical quadrature rules via Gaussian processes. 2017 IEEE 27th International Workshop on Machine Learning for Signal Processing (MLSP).
10. ^ Hennig, Philipp; Kiefel, Martin (2013). "Quasi-Newton methods: A new direction". Journal of Machine Learning Research (JMLR). 14 (1): 843–865. arXiv:1206.4602.
11. ^ Maren Mahsereci; Philipp Hennig (2015). Probabilistic line searches for stochastic optimization. Advances in Neural Information Processing Systems (NeurIPS).
12. ^ Hans Kersting; Nicholas Krämer; Martin Schiegg; Christian Daniel; Michael Tiemann; Philipp Hennig (2020). Differentiable Likelihoods for Fast Inversion of 'Likelihood-Free' Dynamical Systems. International Conference on Machine Learning (ICML).
13. ^ Schmidt, Jonathan; Krämer, Peter Nicholas; Hennig, Philipp (2021). A Probabilistic State Space Model for Joint Inference from Differential Equations and Data. Advances in Neural Information Processing Systems (NeurIPS).
14. ^ Diaconis, P. (1988). "Bayesian Numerical Analysis". Statistical Decision Theory and Related Topics IV: 163–175. doi:10.1007/978-1-4613-8768-8_20. ISBN 978-1-4613-8770-1.
15. ^ O'Hagan, A. (1991). "Bayes–Hermite quadrature". Journal of Statistical Planning and Inference. 29 (3): 245–260. doi:10.1016/0378-3758(91)90002-V.
16. ^ Rasmussen, C.; Ghahramani, Z. (2002). "Bayesian Monte Carlo" (PDF). Neural Information Processing Systems: 489–496.
17. ^ Briol, F.-X.; Oates, C. J.; Girolami, M.; Osborne, M. A.; Sejdinovic, D. (2019). "Probabilistic integration: A role in statistical computation? (with discussion and rejoinder)". Statistical Science. 34 (1): 1–22. arXiv:1512.00933. doi:10.1214/18-STS660. S2CID 13932715.
18. ^ Wilson, Samuel (2019-11-22), ParBayesianOptimization R package, retrieved 2019-12-12
19. ^ Garnett, Roman (2021). Bayesian Optimization. Cambridge: Cambridge University Press.
20. ^ Mahsereci, M.; Hennig, P. (2017). "Probabilistic Line Searches for Stochastic Optimization". Journal of Machine Learning Research. 18 (119): 1–59.
21. ^ Balles, L.; Romero, J.; Hennig, H. (2017). "Coupling Adaptive Batch Sizes with Learning Rates" (PDF). Proceedings of the 33rd Conference on Uncertainty in Artificial Intelligence (UAI). arXiv:1612.05086.
22. ^ Mahsereci, M.; Balles, L.; Lassner, C.; Hennig, H. (2021). "Early Stopping without a Validation Set". arXiv:1703.09580 [cs.LG].
23. ^ Siems J. N.; Klein A.; Archambeau C.; Mahsereci, M. (2021). "Dynamic Pruning of a Neural Network via Gradient Signal-to-Noise Ratio". 8th ICML Workshop on Automated Machine Learning (AutoML).
24. ^ Mahsereci, Maren (2018). "Chapter 8: First-Order Filter for Gradients; chapter 9: Second-Order Filter for Hessian Elements". Probabilistic Approaches to Stochastic Optimization (Thesis). doi:10.15496/publikation-26116.
25. ^ Balles, L.; Hennig, H. (2018). "Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradients". Proceedings of the 35th International Conference on Machine Learning: 404–413. arXiv:1705.07774.
26. ^ a b Bartels, S.; Cockayne, J.; Ipsen, I.; Hennig, P. (2019). "Probabilistic linear solvers: a unifying view". Statistics and Computing. Springer. 29 (6): 1249–1263. doi:10.1007/s11222-019-09897-7. S2CID 53571618.
27. ^ a b Cockayne, J.; Ipsen, I.; Oates, C.; Reid, T. (2021). "Probabilistic iterative methods for linear systems" (PDF). Journal of Machine Learning Research. 22 (232): 1–34. arXiv:2012.12615.
28. ^ Schäfer, Florian; Katzfuss, Matthias; Owhadi, Houman (2021). "Sparse Cholesky Factorization by Kullback–Leibler Minimization". SIAM Journal on Scientific Computing. 43 (3): A2019–A2046. doi:10.1137/20M1336254. ISSN 1064-8275. S2CID 216914317.
29. ^ Bartels, Simon (2020). "Probabilistic Kernel-Matrix Determinant Estimation". Probabilistic Linear Algebra (Thesis). doi:10.15496/publikation-56119.
30. ^ Jonathan Wenger; Geoff Pleiss; Philipp Hennig; John P. Cunningham; Jacob R. Gardner (2021). "Reducing the Variance of Gaussian Process Hyperparameter Optimization with Preconditioning". arXiv:2107.00243 [cs.LG].
31. ^ a b c Conrad, P.R.; Girolami, M.; Särkkä, S.; Stuart, A.M.; Zygalakis, K. (2017). "Statistical analysis of differential equations: introducing probability measures on numerical solutions". Stat. Comput. 27 (4): 1065–1082. doi:10.1007/s11222-016-9671-0. PMC 7089645. PMID 32226237.{{cite journal}}: CS1 maint: multiple names: authors list (link)
32. ^ Abdulle, A.; Garegnani, G. (2020). "Random time step probabilistic methods for uncertainty quantification in chaotic and geometric numerical integration". Stat. Comput. 30 (4): 907–932. arXiv:1801.01340. doi:10.1007/s11222-020-09926-w. S2CID 42880142.{{cite journal}}: CS1 maint: multiple names: authors list (link)
33. ^ Skilling, J. (1992). Bayesian solution of ordinary differential equations. Maximum entropy and Bayesian methods. pp. 23–37.
34. ^ Tronarp, F.; Kersting, H.; Särkkä, S.; Hennig, P (2019). "Probabilistic solutions to ordinary differential equations as nonlinear Bayesian filtering: a new perspective". Statistics and Computing. 29 (6): 1297–1315. doi:10.1007/s11222-019-09900-1. S2CID 88517317.
35. ^ Tronarp, F.; Särkkä, S.; Hennig, P. (2021). "Bayesian ODE solvers: The maximum a posteriori estimate". Statistics and Computing. 31 (3): 1–18. doi:10.1007/s11222-021-09993-7. S2CID 214774980.
36. ^ Kersting, H.; Hennig, P. (2016). Active Uncertainty Calibration in Bayesian ODE Solvers. Uncertainty in Artificial Intelligence. pp. 309–318.
37. ^ Schober, M.; Särkkä, S.; Hennig, P (2019). "A probabilistic model for the numerical solution of initial value problems". Statistics and Computing. 29 (1): 99–122. doi:10.1007/s11222-017-9798-7. S2CID 14299420.
38. ^ Chkrebtii, O.; Campbell, D. A.; Calderhead, B.; Girolami, M. A. (2016). "Bayesian solution uncertainty quantification for differential equations". Bayesian Analysis. 11 (4): 1239–1267. doi:10.1214/16-BA1017. S2CID 14077995.
39. ^ Hennig, P.; Hauberg, S. (2014). Probabilistic solutions to differential equations and their application to Riemannian statistics. Artificial Intelligence and Statistics. pp. 347–355.
40. ^ Abdulle, A.; Garegnani, G. (2021). "A probabilistic finite element method based on random meshes: A posteriori error estimators and Bayesian inverse problems". Comput. Methods Appl. Mech. Engrg. 384: 113961. arXiv:2103.06204. Bibcode:2021CMAME.384k3961A. doi:10.1016/j.cma.2021.113961. S2CID 232170649.{{cite journal}}: CS1 maint: multiple names: authors list (link)
41. ^ Chkrebtii, Oksana A.; Campbell, David A.; Calderhead, Ben; Girolami, Mark A. (2016). "Bayesian Solution Uncertainty Quantification for Differential Equations". Bayesian Analysis. 11 (4): 1239–1267. doi:10.1214/16-BA1017. ISSN 1936-0975. S2CID 14077995.
42. ^ Poincaré, Henri (1912). Calcul des Probabilités (second ed.). Gauthier-Villars.
43. ^ Suldin, A. V. (1959). "Wiener measure and its applications to approximation methods. I". Izv. Vysš. Učebn. Zaved. Matematika. 6 (13): 145–158.
44. ^ a b Larkin, F. M. (1972). "Gaussian measure in Hilbert space and applications in numerical analysis". Rocky Mountain J. Math. 2 (3): 379–421. doi:10.1216/RMJ-1972-2-3-379.
45. ^ Owhadi, Houman; Scovel, Clint; Schäfer, Florian (2019). "Statistical Numerical Approximation". Notices of the American Mathematical Society. 66 (10): 1608–1617. doi:10.1090/noti1963. S2CID 204830421.
46. ^ Palasti, I.; Renyi, A (1956). "On interpolation theory and the theory of games". MTA Mat. Kat. Int. Kozl. 1: 529–540.
47. ^ Sard, A. (1963). Linear Approximation. Mathematical Surveys and Monographs. Vol. 9. American Mathematical Society. doi:10.1090/surv/009. ISBN 9780821815090.
48. ^ Kimeldorf, George S.; Wahba, Grace (1970). "A correspondence between Bayesian estimation on stochastic processes and smoothing by splines". Ann. Math. Statist. 41 (2): 495–502. doi:10.1214/aoms/1177697089.
49. ^ Traub, J. F.; Wasilkowski, G. W.; Woźniakowski, H. (1988). Information-Based Complexity. Computer Science and Scientific Computing. Boston, MA: Academic Press, Inc. ISBN 0-12-697545-0.{{cite book}}: CS1 maint: multiple names: authors list (link)
50. ^ Packel, Edward W. (1987). "The algorithm designer versus nature: a game-theoretic approach to information-based complexity". J. Complexity. 3 (3): 244–257. doi:10.1016/0885-064X(87)90014-8.
51. ^ Owhadi, H. (2017). "Multigrid with rough coefficients and multiresolution operator decomposition from hierarchical information games". SIAM Review. 59 (1): 99–149. doi:10.1137/15M1013894. S2CID 5877877.
52. ^ Micchelli, C. A.; Rivlin, T. J. (1977). "A survey of optimal recovery". Optimal estimation in approximation theory (Proc. Internat. Sympos., Freudenstadt, 1976. pp. 1–54. doi:10.1007/978-1-4684-2388-4_1.