Consistency of randomized integration methods
Julian Hofstadler, Daniel Rudolf

TL;DR
This paper proves the consistency of various randomized numerical integration methods, including $(t,d)$-sequences and Latin hypercube sampling, ensuring their estimators reliably converge to the true integral under certain conditions.
Contribution
It establishes the theoretical consistency of a broad class of randomized integration methods, including median modifications, for integrands in $L^p$ spaces.
Findings
Randomized methods are consistent in mean and probability.
Median modifications achieve almost sure convergence.
Applicability to integrands in $L^p$ with $p>1$.
Abstract
We prove that a class of randomized integration methods, including averages based on -sequences, Latin hypercube sampling, Frolov points as well as Cranley-Patterson rotations, consistently estimates expectations of integrable functions. Consistency here refers to convergence in mean and/or convergence in probability of the estimator to the integral of interest. Moreover, we suggest median modified methods and show for integrands in with consistency in terms of almost sure convergence
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.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference
