On the optimal Halton sequence

Quasi‐Monte Carlo methods are a variant of ordinary Monte Carlo methods that employ highly uniform quasirandom numbers in place of Monte Carlo’s pseudorandom numbers. Clearly, the generation of appropriate high‐quality quasirandom sequences is crucial to the success of quasi‐Monte Carlo methods. The Halton sequence is one of the standard (along with $(t\text{,}s)$ ‐sequences and lattice points) low‐discrepancy sequences, and one of its important advantages is that the Halton sequence is easy to implement due to its definition via the radical inverse function. However, the original Halton sequence suffers from correlations between radical inverse functions with different bases used for different dimensions. These correlations result in poorly distributed two‐dimensional projections. A standard solution to this phenomenon is to use a randomized (scrambled) version of the Halton sequence. An alternative approach to this is to find an optimal Halton sequence within a family of scrambled sequences. This paper presents a new algorithm for finding an optimal Halton sequence within a linear scrambling space. This optimal sequence is numerically tested and shown empirically to be far superior to the original. In addition, based on analysis and insight into the correlations between dimensions of the Halton sequence, we illustrate why our algorithm is efficient for breaking these correlations. An overview of various algorithms for constructing various optimal Halton sequences is also given.