Uncertainty in AI-driven Monte Carlo simulations
read the original abstract
In the study of complex systems, evaluating physical observables often requires sampling representative configurations via Monte Carlo techniques. These methods rely on repeated evaluations of the system's energy and force fields, which can become computationally expensive. To accelerate these simulations, deep learning models are increasingly employed as surrogate functions to approximate the energy landscape or force fields. However, such models introduce epistemic uncertainty in their predictions, which may propagate through the sampling process and affect the simulation's macroscopic behavior. In our work, we present the Penalty Ensemble Method (PEM) to quantify epistemic uncertainty and mitigate its impact on Monte Carlo sampling. Our approach introduces an uncertainty-aware modification of the Metropolis acceptance rule, which increases the rejection probability in regions of high uncertainty, thereby enhancing the reliability of the simulation outcomes.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Topological defects in out-of-equilibrium systems
Motility in heterogeneous Kuramoto lattices enables a BKT transition that restores quasi-long-range order, while non-reciprocity in O(2) models selects defect shapes and enriches annihilation dynamics.
-
Demonstrating Real Advantage of Machine-Learning-Enhanced Monte Carlo for Combinatorial Optimization
Global Annealing Monte Carlo with ML global moves plus local updates outperforms Simulated Annealing and is more robust than Population Annealing on 3D Ising spin glasses without hyperparameter tuning.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.