A new method of randomization of lattice rules for multiple integration
Paul Kabaila

TL;DR
This paper introduces a new practical randomization method for lattice rules in multiple integration, reducing bias compared to traditional approaches that use limited random bits.
Contribution
The paper proposes a novel randomization technique using extended lattice rules with more points, significantly decreasing bias in integral estimation.
Findings
New randomization method reduces estimator bias
Extended lattice rules improve accuracy of integration
Practical implementation avoids need for infinite random bits
Abstract
Cranley and Patterson put forward the following randomization as the basis for the estimation of the error of a lattice rule for an integral of a one-periodic function over the unit cube in s dimensions. The lattice rule is randomized using independent random shifts in each coordinate direction that are uniformly distributed in the interval [0,1]. This randomized lattice rule results in an unbiased estimator of the multiple integral. However, in practice, random variables that are independent and uniformly distributed on [0,1] are not available, since this would require an infinite number of random independent bits. A more realistic practical implementation of the Cranley and Patterson randomization uses rs independent random bits, in the following way. The lattice rule is randomized using independent random shifts in each coordinate direction that are uniformly distributed on {0,…
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
TopicsMathematical Approximation and Integration · Optimization and Packing Problems · Bayesian Methods and Mixture Models
