Moment-informed force rescaling for random-batch Langevin dynamics
Abstract
Random-batch methods accelerate molecular dynamics by replacing full interaction sums with stochastic force estimators. In Langevin simulations, however, random-batch force errors can cause artificial heating and distort equilibrium and dynamical observables, especially for small batch sizes or under weak thermostat coupling. Moreover, the magnitude of these errors can vary across particles. We introduce moment-informed force rescaling for random-batch list (Mi-RBL) and random-batch Ewald (Mi-RBE) methods. A lagged average of each particle's sampled-force intensity sets an isotropic gain before the current batch is sampled, changing the random-batch force magnitude without changing its direction. The formal finite-time analysis quantifies the bias--variance tradeoff, and an estimate of the steady-state kinetic-temperature error predicts the scaling of the kinetic error with time step and thermostat friction. In the coexistence, binary-mixture, and electrolyte tests, Mi-RBL and Mi-RBE reduce kinetic errors and more closely reproduce the mean-square displacement, radial distribution function, and charge density profiles of the reference solutions. Mi-RBE also reduces the growth rate of the kinetic error with the time step by more than half and retains the predicted dependence on thermostat friction. The tested rescaling strength decreases with increasing batch size, and the particlewise update retains O(N) complexity for fixed batch size.
Related
- A General Non-Markovian Electronic Friction and Langevin Dynamics Framework for Nonequilibrium Systems
- Accelerated Langevin Dynamics Simulation via Neural Network-Driven Importance Sampling
- ¹⁸ O-Informed Metabolomics Reveals Microbial Phosphoryl-Transfer Dynamics and Stress-Induced Changes
- Interfacial Mechanisms of Reactive Dye Adsorption on a Waste-Cotton Derived PVA/TiO2/Cellulose Biofilm: A Molecular Dynamics and Physics-Informed Predictive Framework
- RBMD 2.0: Random batch molecular dynamics package for large-scale simulations on multi-GPU architectures
BibTeX
@misc{wu2026momentinformed,
title = {{Moment-informed force rescaling for random-batch Langevin dynamics}},
author = {Xingguo Wu and Yangshuai Wang and Zhenli Xu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.18389},
eprint = {2609.18389},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.18389},
note = {CC0},
}
RIS
TY - UNPB
TI - Moment-informed force rescaling for random-batch Langevin dynamics
AU - Xingguo Wu
AU - Yangshuai Wang
AU - Zhenli Xu
PY - 2026
DA - 2026/09/16
PB - arXiv
DO - 10.48550/arxiv.2609.18389
UR - https://arxiv.org/abs/2609.18389
AB - Random-batch methods accelerate molecular dynamics by replacing full interaction sums with stochastic force estimators. In Langevin simulations, however, random-batch force errors can cause artificial heating and distort equilibrium and dynamical observables, especially for small batch sizes or under weak thermostat coupling. Moreover, the magnitude of these errors can vary across particles. We introduce moment-informed force rescaling for random-batch list (Mi-RBL) and random-batch Ewald (Mi-RBE) methods. A lagged average of each particle's sampled-force intensity sets an isotropic gain before the current batch is sampled, changing the random-batch force magnitude without changing its direction. The formal finite-time analysis quantifies the bias--variance tradeoff, and an estimate of the steady-state kinetic-temperature error predicts the scaling of the kinetic error with time step and thermostat friction. In the coexistence, binary-mixture, and electrolyte tests, Mi-RBL and Mi-RBE reduce kinetic errors and more closely reproduce the mean-square displacement, radial distribution function, and charge density profiles of the reference solutions. Mi-RBE also reduces the growth rate of the kinetic error with the time step by more than half and retains the predicted dependence on thermostat friction. The tested rescaling strength decreases with increasing batch size, and the particlewise update retains O(N) complexity for fixed batch size.
ER -