Performance of machine-learning-assisted Monte Carlo in sampling from simple statistical physics models
Luca Maria Del Bono, Federico Ricci-Tersenghi, Francesco Zamponi
TL;DR
The work addresses the theoretical understanding of machine-learning-assisted Monte Carlo sampling for simple statistical physics models by focusing on Sequential/Global Annealing with a shallow MADE applied to the Curie-Weiss model. It provides an analytic description of the optimal MADE weights, their thermodynamic-limit behavior, and the gradient-based training dynamics, revealing a critical slowing-down analogue in learning at the critical point. It further benchmarks the Global Annealing procedure against standard local Metropolis Monte Carlo, showing that a perfectly trained MADE can eliminate the need for local moves for small temperature steps, while imperfect training benefits from incorporating local updates, as quantified by first-passage times. The results offer a principled framework for integrating neural-network proposals with traditional MC, informing practical annealing schedules and the trade-offs between training time and sampling efficiency in multi-state systems.
Abstract
Recent years have seen a rise in the application of machine learning techniques to aid the simulation of hard-to-sample systems that cannot be studied using traditional methods. Despite the introduction of many different architectures and procedures, a wide theoretical understanding is still lacking, with the risk of suboptimal implementations. As a first step to address this gap, we provide here a complete analytic study of the widely-used Sequential Tempering procedure applied to a shallow MADE architecture for the Curie-Weiss model. The contribution of this work is twofold: firstly, we give a description of the optimal weights and of the training under Gradient Descent optimization. Secondly, we compare what happens in Sequential Tempering with and without the addition of local Metropolis Monte Carlo steps. We are thus able to give theoretical predictions on the best procedure to apply in this case. This work establishes a clear theoretical basis for the integration of machine learning techniques into Monte Carlo sampling and optimization.
