Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions
Kosuke Suzuki

TL;DR
This paper proves super-polynomial convergence rates for multivariate integration of infinitely differentiable functions, showing that quasi-Monte Carlo methods with digital nets achieve these rates under certain conditions.
Contribution
It establishes new super-polynomial convergence bounds for multivariate integration in infinitely smooth function spaces, extending tractability results.
Findings
Error bounds of order exp(-c(log n)^2) for general weights
Improved bounds of order exp(-c(log n)^p) for fast-decaying weights
Quasi-Monte Carlo methods with digital nets attain these convergence rates
Abstract
We investigate multivariate integration for a space of infinitely times differentiable functions , where , and is a sequence of positive decreasing weights. Let be the minimal worst-case error of all algorithms that use function values in the -variate case. We prove that for any and considered holds for all , where and are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Mathematical functions and polynomials · Matrix Theory and Algorithms
