Convergence of Random Batch Method with replacement for interacting particle systems
Zhenhao Cai, Jian-Guo Liu, Yuliang Wang

TL;DR
This paper analyzes the convergence and efficiency of the Random Batch Method with replacement (RBM-r), a kinetic Monte Carlo algorithm for simulating large interacting particle systems, providing rigorous error bounds and computational advantages.
Contribution
It offers a rigorous convergence analysis of RBM-r with explicit rates, demonstrating its unbiased approximation and computational efficiency for large particle systems.
Findings
RBM-r reduces computational complexity from O(N^2) to O(pN).
The Wasserstein-2 distance between IPS and RBM-r has an O(κ^{1/4}) upper bound.
An improved O(κ^{1/2}) rate is achieved without diffusion.
Abstract
The Random Batch Method (RBM) proposed in [Jin et al. J Comput Phys, 2020] is an efficient algorithm for simulating interacting particle systems (IPS). In this paper, we investigate the Random Batch Method with replacement (RBM-r), which is the same as the kinetic Monte Carlo (KMC) method for the pairwise interacting particle system of size . In the RBM-r algorithm, one randomly picks a small batch of size , and only the particles in the picked batch interact among each other within the batch for a short time, where the weak interaction (of strength ) in the original system is replaced by a strong interaction (of strength ). Then one repeats this pick-interact process. This KMC algorithm dramatically reduces the computational cost from to per time step, and provides an unbiased approximation of the original force/velocity field…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImage Processing and 3D Reconstruction
