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

Necessity of low eective dimension

Art B. Owen

Published Jan 1, 2002• 8 citations
OpenAlex

Abstract

Practitioners have long noticed that quasi-Monte Carlo methods work very well on functions that are nearly superpositions of low dimensional functions. The reason is that the low dimensional coordinate projections of QMC rules can have very good equidistribution properties at sample sizes for which the original rule itself cannot have good equidistribution. This paper explores a converse proposal: that low eective dimension is necessary for QMC to be much better than MC in high dimensions with practical sample sizes.

Related papers

Quasi-Monte Carlo methods for simulation

Pierre L’Ecuyer

Quasi-Monte Carlo (QMC) methods are numerical techniques for estimating large-dimensional integrals, usually over the unit hypercube. They can be applied, at least in principle, to any simulation whose aim is to estimate a mathematical expectation. This covers a very wide range of applications. In this paper, we review some of the key ideas of quasi-Monte Carlo methods from a broad perspective, with emphasis on some recent results. We visit lattice rules in different types of spaces and make the connections between these rules and digital nets, thus covering the two most widely used QMC methods.

International Conference on Machine Learning and Cybernetics•May 6, 2004•4 citations

High-dimensional quasi-Monte Carlo via combinatorial discrepancy

Jiaheng Chen, Haotian Jiang, Nathan Kirk

Quasi-Monte Carlo (QMC) methods are known to achieve faster convergence rates than Monte Carlo (MC), but their effectiveness in high dimensions often relies on additional structure, such as low effective dimension or carefully chosen coordinate weights. Moreover, in many applications one has access only to random samples rather than deterministic QMC constructions. In this work, we extend the recent method of N. Bansal and H. Jiang and construct high-dimensional QMC point sets from random samples via combinatorial discrepancy. We establish error bounds for these constructions in weighted function spaces, including settings with low effective dimension in both the superposition and truncation senses. We also implement the resulting Subgaussian Transference algorithm and present numerical experiments to assess empirically the performance of these constructions.

arXiv:2508.18426•Journal of Complexity•May 5, 2026•2 citations

Efficiency of Quasi-Monte Carlo Algorithms for High Dimensional Integrals

Henryk Woźniakowski

Springer eBooks•Jan 1, 2000•36 citations

Quasi-Monte Carlo integration of functions of unbounded variation

Ronald F. A. Cools, Tim Pillards

qMC integration of functions of unbounded variation Quasi-Monte Carlo Functions of unbounded variation Conclusion

•Sep 1, 2006•0 citations

Deterministic algorithm for optimising the direction numbers of the Sobol’ sequence

Emanouil I. Atanassov

The quasi-Monte Carlo (QMC) methods use deterministic, usually low-discrepancy sequences, to improve the order of convergence when compared with Monte Carlo methods dealing with the same problem. Although this improved convergence depends on the smoothness properties of the functions under consideration and sometimes cannot be established theoretically, good practical results were obtained in many areas, notably in Financial Mathematics. Most of the QMC methods do not depend on particular properties of the sequences used beyond their good distribution in a suitable multidimensional space. Many families of low-discrepancy sequences have been studies, with the family of the Sobol sequences being not only one of the oldest but also the most popular in practical applications. Since these sequences have many free parameters, it is desirable to have methods to obtain a good set of parameters, suitable for a wide class of problems. In this work we propose a fully deterministic method for optimisation of the direction numbers of the Sobol sequences that is flexible in taking into account smoothness properties of the potential sub-integral functions. We demonstrate how by implementing this algorithm on modern GPUs it is possible to obtain good sets of direction numbers within a reasonable timeframe. The numerical tests demonstrate the significant advantage in terms of accuracy that is observed, which makes the corresponding QMC methods even more competitive.

Mathematics and Education in Mathematics•Jan 1, 2021•0 citations

QMCPy: A Python Framework for (Quasi-)Monte Carlo Algorithms

Aleksei G. Sorokin, Fred J. Hickernell, Sou-Cheng Terrya Choi +3 more

Monte Carlo (MC) methods estimate high-dimensional integrals by computing sample averages at independent and identically distributed (IID) random points.Quasi-Monte Carlo (QMC) methods replace IID samples with low-discrepancy (LD) sequences which more uniformly cover the integration domain, leading to faster convergence and reduced computational requirements.

The Journal of Open Source Software•Jan 19, 2026•2 citations
Practitioners have long noticed that quasi-Monte Carlo methods work very well on functions that are nearly superpositions of low dimensional functions. The reason is that the low dimensional coordinate projections of QMC rules can have very good equidistribution properties at sample sizes for which the original rule itself cannot have good equidistribution. This paper explores a converse proposal: that low eective dimension is necessary for QMC to be much better than MC in high dimensions with practical sample sizes.
Quasi-Monte Carlo (QMC) methods are numerical techniques for estimating large-dimensional integrals, usually over the unit hypercube. They can be applied, at least in principle, to any simulation whose aim is to estimate a mathematical expectation. This covers a very wide range of applications. In this paper, we review some of the key ideas of quasi-Monte Carlo methods from a broad perspective, with emphasis on some recent results. We visit lattice rules in different types of spaces and make the connections between these rules and digital nets, thus covering the two most widely used QMC methods.
Quasi-Monte Carlo (QMC) methods are known to achieve faster convergence rates than Monte Carlo (MC), but their effectiveness in high dimensions often relies on additional structure, such as low effective dimension or carefully chosen coordinate weights. Moreover, in many applications one has access only to random samples rather than deterministic QMC constructions. In this work, we extend the recent method of N. Bansal and H. Jiang and construct high-dimensional QMC point sets from random samples via combinatorial discrepancy. We establish error bounds for these constructions in weighted function spaces, including settings with low effective dimension in both the superposition and truncation senses. We also implement the resulting Subgaussian Transference algorithm and present numerical experiments to assess empirically the performance of these constructions.
The quasi-Monte Carlo (QMC) methods use deterministic, usually low-discrepancy sequences, to improve the order of convergence when compared with Monte Carlo methods dealing with the same problem. Although this improved convergence depends on the smoothness properties of the functions under consideration and sometimes cannot be established theoretically, good practical results were obtained in many areas, notably in Financial Mathematics. Most of the QMC methods do not depend on particular properties of the sequences used beyond their good distribution in a suitable multidimensional space. Many families of low-discrepancy sequences have been studies, with the family of the Sobol sequences being not only one of the oldest but also the most popular in practical applications. Since these sequences have many free parameters, it is desirable to have methods to obtain a good set of parameters, suitable for a wide class of problems. In this work we propose a fully deterministic method for optimisation of the direction numbers of the Sobol sequences that is flexible in taking into account smoothness properties of the potential sub-integral functions. We demonstrate how by implementing this algorithm on modern GPUs it is possible to obtain good sets of direction numbers within a reasonable timeframe. The numerical tests demonstrate the significant advantage in terms of accuracy that is observed, which makes the corresponding QMC methods even more competitive.