Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Complexity

Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands

Frances Y. Kuo, Ian H. Sloan, G.W. Wasilkowski, Benjamin J. Waterhouse

Published Oct 26, 2009• 55 citations
Publisher
DOI
10.1016/j.jco.2009.07.005

Related papers

Fast CBC construction of randomly shifted lattice rules achieving O ( n − 1 + δ ) convergence for unbounded integrands over R s in weighted spaces with POD weights

James Nichols, Frances Y. Kuo

Journal of Complexity•Feb 11, 2014•50 citations

Lattice Rules and Randomized Quasi-Monte Carlo

Pierre L’Ecuyer

Lecture notes in computer science•Jan 1, 2001•0 citations

Path integral Monte Carlo on a lattice

Mark O'Callaghan

•Jan 1, 2016•0 citations

On the error distribution for randomly-shifted lattice rules

Pierre L’Ecuyer, Bruno Tuffin

Randomized quasi-Monte Carlo (RQMC) methods estimate the expectation of a random variable by the average of n dependent realizations of it. In general, due to the strong dependence, the estimation error may not obey a central limit theorem. Analysis of RQMC methods have so far focused mostly on the convergence rates of asymptotic worst-case error bounds and variance bounds, when n ¿ ¿, but little is known about the limiting distribution of the error. Here we examine this limiting distribution for the special case of a randomly-shifted lattice rule, when the integrand is smooth. We start with simple one-dimensional functions, where we show that the limiting distribution is uniform over a bounded interval if the integrand is non-periodic, and has a square root form over a bounded interval if the integrand is periodic. In higher dimensions, for linear functions, the distribution function of the properly standardized error converges to a spline of degree equal to the dimension.

Winter Simulation Conference•Dec 1, 2009•2 citations

Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration

Frances Y. Kuo, Dirk Nuyens, Laurence Wilkes

arXiv:2304.10413•Journal of Complexity•Aug 2, 2023•9 citations

The construction of good lattice rules and polynomial lattice rules

Dirk Nuyens

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by the optimal rate of convergence for the function space. The focus is on algebraic rates of convergence $O(N^{-α+ε})$ for $α\ge 1$ and any $ε> 0$, where $α$ is the decay of a series representation of the integrand function. The dependence of the implied constant on the dimension can be controlled by weights which determine the influence of the different dimensions. Different types of weights are discussed. The construction of good lattice rules, and polynomial lattice rules, can be done using the same method for all $1 < p \le \infty$; but the case $p=1$ is special from the construction point of view. For $1 < p \le \infty$ the component-by-component construction and its fast algorithm for different weighted function spaces is then discussed.

arXiv:1308.3601•De Gruyter eBooks•Jul 25, 2014•47 citations
Randomized quasi-Monte Carlo (RQMC) methods estimate the expectation of a random variable by the average of n dependent realizations of it. In general, due to the strong dependence, the estimation error may not obey a central limit theorem. Analysis of RQMC methods have so far focused mostly on the convergence rates of asymptotic worst-case error bounds and variance bounds, when n ¿ ¿, but little is known about the limiting distribution of the error. Here we examine this limiting distribution for the special case of a randomly-shifted lattice rule, when the integrand is smooth. We start with simple one-dimensional functions, where we show that the limiting distribution is uniform over a bounded interval if the integrand is non-periodic, and has a square root form over a bounded interval if the integrand is periodic. In higher dimensions, for linear functions, the distribution function of the properly standardized error converges to a spline of degree equal to the dimension.
A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on ℓp\ell_pℓp​ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by the optimal rate of convergence for the function space. The focus is on algebraic rates of convergence O(N−α+ε)O(N^{-α+ε})O(N−α+ε) for α≥1α\ge 1α≥1 and any ε>0ε> 0ε>0, where ααα is the decay of a series representation of the integrand function. The dependence of the implied constant on the dimension can be controlled by weights which determine the influence of the different dimensions. Different types of weights are discussed. The construction of good lattice rules, and polynomial lattice rules, can be done using the same method for all 1<p≤∞1 < p \le \infty1<p≤∞; but the case p=1p=1p=1 is special from the construction point of view. For 1<p≤∞1 < p \le \infty1<p≤∞ the component-by-component construction and its fast algorithm for different weighted function spaces is then discussed.