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

Quasi-Monte Carlo integration of functions of unbounded variation

Ronald F. A. Cools, Tim Pillards

Published Sep 1, 2006• 0 citations
OpenAlex

Abstract

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

Related papers

A New Quasi-Monte Carlo Algorithm for Numerical Integration of Smooth Functions

Emanouil I. Atanassov, Ivan Dimov, Mariya K. Durchova

Lecture notes in computer science•Jan 1, 2004•3 citations

Construction of Quasi-Monte Carlo Rules for Multivariate Integration in Spaces of Permutation-Invariant Functions

Dirk Nuyens, Gowri Suryanarayana, Markus Weimar

arXiv:1507.08084•Constructive Approximation•Jan 9, 2017•4 citations

Optimal Point Sets for Quasi-Monte Carlo Integration of Bivariate Periodic Functions with Bounded Mixed Derivatives

Aicke Hinrichs, Jens Oettershagen

arXiv:1409.5894•Springer proceedings in mathematics & statistics•Jan 1, 2016•28 citations

Error bounds for quasi-Monte Carlo integration with uniform point sets

Harald Niederreiter

Journal of Computational and Applied Mathematics•Dec 3, 2002•28 citations

Quasi-Monte Carlo Beyond Hardy-Krause

Nikhil Bansal, Haotian Jiang

We examine the problem of numerically estimating the integral of a function f. The classical approaches to this problem are Monte Carlo (MC) and quasi-Monte Carlo (QMC) methods. MC methods use random samples to evaluate f and have error , where σ(f ) is the standard deviation of f. QMC methods are based on evaluating f at explicit point sets with low discrepancy, and as given by the classical Koksma- Hlawka inequality, they have error Õ (σHK(f )/n ), where σΗΚ(f ) is the variation of f in the sense of Hardy and Krause. These two methods have distinctive advantages and shortcomings, and a fundamental question is to find a method that combines the advantages of both.

arXiv:2408.06475•Society for Industrial and Applied Mathematics eBooks•Jan 1, 2025•2 citations

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Ekene Ezeunala, Agastya Vibhuti Jha, Haotian Jiang

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(σ_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $σ_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

arXiv:2609.10921•Sep 10, 2026•0 citations
We examine the problem of numerically estimating the integral of a function f. The classical approaches to this problem are Monte Carlo (MC) and quasi-Monte Carlo (QMC) methods. MC methods use random samples to evaluate f and have error , where σ(f ) is the standard deviation of f. QMC methods are based on evaluating f at explicit point sets with low discrepancy, and as given by the classical Koksma- Hlawka inequality, they have error Õ (σHK(f )/n ), where σΗΚ(f ) is the variation of f in the sense of Hardy and Krause. These two methods have distinctive advantages and shortcomings, and a fundamental question is to find a method that combines the advantages of both.
Quasi-Monte Carlo Beyond Hardy-Krause II: (1+ε)n(1 + \varepsilon)n(1+ε)n Samples Suffice
Numerical integration studies how well one can estimate the integral of a function fff over [0,1)d[0,1)^d[0,1)d using nnn sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error O~d(σSO(f)/n)\widetilde{O}_d(σ_{\mathsf{SO}}(f)/n)Od​(σSO​(f)/n), where the smoothed-out variation σSO(f)σ_{\mathsf{SO}}(f)σSO​(f) can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires n2n^2n2 i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant ε>0\varepsilon > 0ε>0, we show that (1+ε)n(1+\varepsilon)n(1+ε)n i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.