Linear Monte Carlo quadrature with optimal confidence intervals (2309.09059v2)
Abstract: We study the numerical integration of functions from isotropic Sobolev spaces $W_ps([0,1]d)$ using finitely many function evaluations within randomized algorithms, aiming for the smallest possible probabilistic error guarantee $\varepsilon > 0$ at confidence level $1-\delta \in (0,1)$. For spaces consisting of continuous functions, non-linear Monte Carlo methods with optimal confidence properties have already been known, in few cases even linear methods that succeed in that respect. In this paper we promote a new method called stratified control variates (SCV) and by it show that already linear methods achieve optimal probabilistic error rates in the high smoothness regime without the need to adjust algorithmic parameters to the uncertainty $\delta$. We also analyse a version of SCV in the low smoothness regime where $W_ps([0,1]d)$ may contain functions with singularities. Here, we observe a polynomial dependence of the error on $\delta{-1}$ which cannot be avoided for linear methods. This is worse than what is known to be possible using non-linear algorithms where only a logarithmic dependence on $\delta{-1}$ occurs if we tune in for a specific value of $\delta$.
- R.A. Adams, J.J.F. Fournier. Sobolev Spaces, second edition. Academic Press, 2003.
- B. von Bahr, C. Esseen. Inequalities for the r𝑟ritalic_rth absolute moment of a sum of random variables, 1≤r≤21𝑟21\leq r\leq 21 ≤ italic_r ≤ 2. Annals of Mathematical Statistics, 36:299–303, 1965.
- D.L. Burkholder. Sharp inequalities for martingales and stochastic integrals. Astérisque, tome 157–158 (1988), p. 75–94.
- P.G. Ciarlet. The Finite Element Method for Elliptic Problems. SIAM, 1978.
- Compressed sensing and best k𝑘kitalic_k-term approximation. Journal of the AMS 22:211–231, 2009.
- Hyperbolic Cross Approximation. Advanced Courses in Mathematics - CRM Barcelona. Birkhäuser/Springer, 2018.
- S. Heinrich. Randomized approximation of Sobolev embeddings. Proceedings of the MCQMC 2006, 445–459, 2008.
- D. Krieg, E. Novak. A universal algorithm for univariate integration. Foundations of Computational Mathematics, 17:895-916, 2017.
- Lattice rules with random n𝑛nitalic_n achieve nearly the optimal 𝒪(n−α−1/2)𝒪superscript𝑛𝛼12\mathcal{O}(n^{-\alpha-1/2})caligraphic_O ( italic_n start_POSTSUPERSCRIPT - italic_α - 1 / 2 end_POSTSUPERSCRIPT ) error independently of the dimension. Journal of Approximation Theory, 240:96–113, 2019.
- Solvable integration problems and optimal sample size selection. Journal of Complexity, 53:40–67, 2019.
- R.J. Kunsch, D. Rudolf. Optimal confidence for Monte Carlo integration of smooth functions. Advances in Computational Mathematics, 45:3095–3122, 2019.
- Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration. Preprint available on arXiv:2304.10413 [math.NA], 2023.
- E. Novak. Deterministic and Stochastic Error Bounds in Numerical Analysis. Lecture Notes in Mathematics 1349, Springer-Verlag, Berlin, 1988.
- D. Nuyens, L. Wilkes. A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with 0<α≤1/20𝛼120<\alpha\leq 1/20 < italic_α ≤ 1 / 2. Preprint available on arXiv:2308.03138 [math.NA], 2023.
- V.N. Temlyakov. Approximation of periodic functions of several variables by bilinear forms. Izvestiya AN SSSR, 50:137–155, 1986. English translation in Math. USSR Izvestija 28:133–150, 1987.
- Information-Based Complexity. Academic Press, 1988.
- M. Ullrich. A Monte Carlo method for integration of multivariate smooth functions. SIAM Journal on Numerical Analysis, 55(3):1188-1200, 2017.
- J. Vybíral. Sampling numbers and function spaces. Journal of Complexity, 23:773–792, 2007.