arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.06475cs.DScs.CGcs.DMcs.NAmath.NA
收藏

超越Hardy-Krause的拟蒙特卡洛方法

Quasi-Monte Carlo Beyond Hardy-Krause

Nikhil Bansal, Haotian Jiang

AI总结:

本研究提出一种结合几何偏差迁移原理与组合偏差算法创新的随机化QMC算法,生成的点集误差界优于经典Koksma-Hlawka不等式,兼具MC与QMC的优势且效率极高。

摘要:

数值积分函数$f$的经典方法是蒙特卡洛(MC)和拟蒙特卡洛(QMC)方法。MC方法使用随机样本计算$f$的取值,误差为$O(σ(f)/\sqrt{n})$,其中$σ(f)$是$f$的标准差。QMC方法基于在具有低偏差的显式点集上计算$f$的取值,根据经典的Koksma-Hlawka不等式,其误差为$\widetilde{O}(σ_{\mathsf{HK}}(f)/n)$,其中$σ_{\mathsf{HK}}(f)$是Hardy和Krause意义下$f$的变差。这两种方法各有显著的优缺点,一个核心问题是找到一种能结合两者优势的方法。\n 在本研究中,我们提出了一种简单的随机化算法,它生成的QMC点集具备以下优良特性:(1) 其误差远优于经典Koksma-Hlawka不等式给出的界。具体而言,误差为$\widetilde{O}(σ_{\mathsf{SO}}(f)/n)$,其中$σ_{\mathsf{SO}}(f)$是我们提出的一种新的变差度量,其值远小于Hardy-Krause变差。(2) 该算法仅需要从底层分布中获取随机样本,因此具备与MC方法一样的灵活性。(3) 它能以最优方式自动兼具MC和QMC的优势(以及上述对Hardy-Krause变差的改进效果)。(4) 该算法效率极高,每个样本的摊销运行时间为$\widetilde{O}(1)$。\n 我们的方法基于几何偏差中的经典迁移原理,并结合了组合偏差领域的最新算法创新——这类算法除了能生成低偏差着色外,还能保证一定的次高斯性质。这使得我们能够突破以往研究在弥合MC与QMC方法差距时的若干限制,实现超越Hardy-Krause变差的效果。

英文摘要:

The classical approaches to numerically integrating a function $f$ are Monte Carlo (MC) and quasi-Monte Carlo (QMC) methods. MC methods use random samples to evaluate $f$ and have error $O(σ(f)/\sqrt{n})$, 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 $\widetilde{O}(σ_{\mathsf{HK}}(f)/n)$, where $σ_{\mathsf{HK}}(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. In this work, we give a simple randomized algorithm that produces QMC point sets with the following desirable features: (1) It achieves substantially better error than given by the classical Koksma-Hlawka inequality. In particular, it has error $\widetilde{O}(σ_{\mathsf{SO}}(f)/n)$, where $σ_{\mathsf{SO}}(f)$ is a new measure of variation that we introduce, which is substantially smaller than the Hardy-Krause variation. (2) The algorithm only requires random samples from the underlying distribution, which makes it as flexible as MC. (3) It automatically achieves the best of both MC and QMC (and the above improvement over Hardy-Krause variation) in an optimal way. (4) The algorithm is extremely efficient, with an amortized $\widetilde{O}(1)$ runtime per sample. Our method is based on the classical transference principle in geometric discrepancy, combined with recent algorithmic innovations in combinatorial discrepancy that besides producing low-discrepancy colorings, also guarantee certain subgaussian properties. This allows us to bypass several limitations of previous works in bridging the gap between MC and QMC methods and go beyond the Hardy-Krause variation.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑