# zbMATH — the first resource for mathematics

Comment on “Probabilistic integration: a role in statistical computation?”. (English) Zbl 1420.62139
Summary: Probabilistic integration provides a criterion for stopping a simulation when a specified error tolerance is satisfied with high confidence. We comment on some of the modeling assumptions and implementation issues involved in designing an automatic Bayesian cubature.
Comment on [F.-X. Briol et al., ibid. 34, No. 1, 1–22 (2019; Zbl 1420.62135)].

##### MSC:
 62G05 Nonparametric estimation 65D30 Numerical integration 65C60 Computational problems in statistics (MSC2010)
Full Text:
##### References:
 [1] Briol, F.-X., Oates, C. J., Griolami, M., Osborne, M. A. and Sejdinovic, D. (2019). Probabilistic integration: A role in statistical computation? Statist. Sci.34 1-22. [2] Dick, J., Kuo, F. Y. and Sloan, I. H. (2013). High-dimensional integration: The quasi-Monte Carlo way. Acta Numer.22 133-288. · Zbl 1296.65004 [3] Hickernell, F. J. (1996). Quadrature error bounds with applications to lattice rules. SIAM J. Numer. Anal.33 1995-2016. · Zbl 0855.41024 [4] Hickernell, F. J. (1998). Lattice rules: How well do they measure up? In Random and Quasi-Random Point Sets. Lect. Notes Stat.138 109-166. Springer, New York. · Zbl 0920.65010 [5] Shah, A., Wilson, A. G. and Ghahramani, Z. (2014). Student-$$t$$ processes as alternatives to Gaussian processes. In Proceedings of the 17th International Conference on Artificial Intelligence and Statistics (AISTATS) 2014, Reykjavik, Iceland, PLMR (S. Kaski and J. Corander, eds.) 33 877-885. [6] Sloan, I. H. and Joe, S. (1994). Lattice Methods for Multiple Integration. Oxford Science Publications. Oxford University Press, New York. · Zbl 0855.65013
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.