arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.01397math.NAcs.NA
收藏

使用中位数均值法的随机化网络自动最优速率收敛性

Automatic optimal-rate convergence of randomized nets using median-of-means

Zexin Pan

AI总结:

本文提出对基于随机化数字网络的拟蒙特卡洛估计量取样本中位数,无需预知函数空间或预设 $(t,m,s)$-数字网络,即可在多种函数空间实现近最优收敛并抑制重尾异常值。

摘要:

我们研究了基于随机化数字网络独立生成的拟蒙特卡洛估计量的样本中位数,并证明其在多种函数空间中以几乎最优的收敛速率逼近目标积分值。与以往方法相比,该算法不需要预先知道底层函数空间,甚至不需要输入预先设计的 $(t,m,s)$-数字网络,因此更易于实现。本研究进一步证明,拟蒙特卡洛估计量应用于光滑被积函数时具有重尾特性,而取中位数可通过滤除异常值显著改善误差。

英文摘要:

We study the sample median of independently generated quasi-Monte Carlo estimators based on randomized digital nets and prove it approximates the target integral value at almost the optimal convergence rate for various function spaces. In contrast to previous methods, the algorithm does not require a priori knowledge of underlying function spaces or even an input of pre-designed $(t,m,s)$-digital nets, and is therefore easier to implement. This study provides further evidence that quasi-Monte Carlo estimators are heavy-tailed when applied to smooth integrands and taking the median can significantly improve the error by filtering out the outliers.

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

↑