Lattice rules with random $n$ achieve nearly the optimal $\mathcal{O}(n^{-α-1/2})$ error independently of the dimension

We analyze a new random algorithm for numerical integration of $d$-variate functions over $[0,1]^d$ from a weighted Sobolev space with dominating mixed smoothness $α\ge 0$ and product weights $1\geγ_1\geγ_2\ge\cdots>0$, where the functions are continuous and periodic when $α>1/2$. The algorithm is based on rank-$1$ lattice rules with a random number of points~$n$. For the case $α>1/2$, we prove that the algorithm achieves almost the optimal order of convergence of $\mathcal{O}(n^{-α-1/2})$, where the implied constant is independent of the dimension~$d$ if the weights satisfy $\sum_{j=1}^\infty γ_j^{1/α}<\infty$. The same rate of convergence holds for the more general case $α>0$ by adding a random shift to the lattice rule with random $n$. This shows, in particular, that the exponent of strong tractability in the randomized setting equals $1/(α+1/2)$, if the weights decay fast enough. We obtain a lower bound to indicate that our results are essentially optimal. This paper is a significant advancement over previous related works with respect to the potential for implementation and the independence of error bounds on the problem dimension. Other known algorithms which achieve the optimal error bounds, such as those based on Frolov's method, are very difficult to implement especially in high dimensions. Here we adapt a lesser-known randomization technique introduced by Bakhvalov in 1961. This algorithm is based on rank-$1$ lattice rules which are very easy to implement given the integer generating vectors. A simple probabilistic approach can be used to obtain suitable generating vectors.