Papers › Speeding up Monte Carlo Integration: Control Neighbors for Optimal Convergence
Speeding up Monte Carlo Integration: Control Neighbors for Optimal Convergence
Rémi Leluc, François Portier, Johan Segers, Aigerim Zhuman
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A novel linear integration rule called control neighbors is proposed in which nearest neighbor estimates act as control variates to speed up the convergence rate of the Monte Carlo procedure on metric spaces. The main result is the 𝒪(n^(-1/2) n^(-s/d)) convergence rate -- where n stands for the number of evaluations of the integrand and d for the dimension of the domain -- of this estimate for H\"older functions with regularity s ∈(0,1], a rate which, in some sense, is optimal. Several numerical experiments validate the complexity bound and highlight the good performance of the proposed estimator.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections