English

Median of Means Sampling for the Keister Function

Methodology 2025-01-22 v1 Machine Learning Numerical Analysis Numerical Analysis Computation Machine Learning

Abstract

This study investigates the performance of median-of-means sampling compared to traditional mean-of-means sampling for computing the Keister function integral using Randomized Quasi-Monte Carlo (RQMC) methods. The research tests both lattice points and digital nets as point distributions across dimensions 2, 3, 5, and 8, with sample sizes ranging from 2^8 to 2^19 points. Results demonstrate that median-of-means sampling consistently outperforms mean-of-means for sample sizes larger than 10^3 points, while mean-of-means shows better accuracy with smaller sample sizes, particularly for digital nets. The study also confirms previous theoretical predictions about median-of-means' superior performance with larger sample sizes and reflects the known challenges of maintaining accuracy in higher-dimensional integration. These findings support recent research suggesting median-of-means as a promising alternative to traditional sampling methods in numerical integration, though limitations in sample size and dimensionality warrant further investigation with different test functions and larger parameter spaces.

Keywords

Cite

@article{arxiv.2501.10440,
  title  = {Median of Means Sampling for the Keister Function},
  author = {Bocheng Zhang},
  journal= {arXiv preprint arXiv:2501.10440},
  year   = {2025}
}
R2 v1 2026-06-28T21:09:43.048Z