Speeding up Monte Carlo Integration: Control Neighbors for Optimal Convergence
Rémi Leluc, François Portier, Johan Segers, Aigerim Zhuman
TL;DR
The paper tackles the slow convergence of standard Monte Carlo integration by introducing control neighbors, a variance-reduction scheme that uses leave-one-out 1-NN predictions as control variates on metric spaces. This yields a provably faster rate $\mathcal{O}(n^{-1/2} n^{-s/d})$ for Hölder integrands with regularity $s\in(0,1]$, and is applicable beyond Euclidean cubes to manifolds and other compact spaces. The authors provide a comprehensive theoretical framework (ball-measure distributions, NN-distance moments, RMSE and concentration bounds) and show practical implementation details, with numerical experiments across diverse spaces and an OT application demonstrating substantial variance reduction. The method maintains a simple linear-in-phi form, does not require known integrals of the control variates, and can be fitted after sampling, making it attractive for repeated-integral tasks and manifold-valued domains. Overall, control neighbors offer a principled, broadly applicable approach to accelerate Monte Carlo integration in smooth regimes where evaluations are costly.
Abstract
A novel linear integration rule called $\textit{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 $\mathcal{O}(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ölder functions with regularity $s \in (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.
