Stochastic optimisation method for estimating large deviations
Abstract
A stochastic optimisation method was recently proposed to efficiently compute large deviation functions, used in statistical physics to characterise the fluctuations of nonequilibrium systems, modelled as Markov processes. The method, called LDSTOP, combines numerical techniques from control theory and machine learning to iteratively construct the "driven process", a controlled version of the Markov process used as a model of nonequilibrium system that realises a given fluctuation or large deviation of that system in an optimal way. Compared to other methods based on spectral approximations, importance sampling, cloning or splitting, LDSTOP is simple, flexible, and scalable, as it works by simulating single trajectories that are gradually guided towards the driven process. Here, we illustrate these advantages by applying the method on the full range of Markov processes considered in applications, namely, discrete-time Markov chains, continuous-time jump processes, and diffusion processes. For each type, we define the objective function to be optimised, explain different options available for representing the driven process (using, e.g., neural networks), and provide implementation details through simple applications. With these contributions, we aim to showcase the method's efficiency, as well as its ease of use when combined with available machine learning packages, such as PyTorch, TensorFlow and JAX, for simulating stochastic processes and solving high-dimensional optimisation problems.
Related
- Large Deviations in Stochastic Dynamics: A Hamiltonian Perspective
- Self-compensation method for atmospheric refraction-induced deviations in satellite-to-ground one-way laser timing and positioning
- Dynamical large deviations, self-similarity, and criticality
- Large deviations in the many-body localization transition: The case of the random-field XXZ chain
- Large Deviations for the Bose--Einstein Condensate of the Ideal Gas in the Canonical Ensemble
BibTeX
@misc{cloete2026stochastic,
title = {{Stochastic optimisation method for estimating large deviations}},
author = {Daniël W. H. Cloete and Hugo Touchette},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.24473},
eprint = {2609.24473},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.24473},
}
RIS
TY - UNPB
TI - Stochastic optimisation method for estimating large deviations
AU - Daniël W. H. Cloete
AU - Hugo Touchette
PY - 2026
DA - 2026/09/21
PB - arXiv
DO - 10.48550/arxiv.2609.24473
UR - https://arxiv.org/abs/2609.24473
AB - A stochastic optimisation method was recently proposed to efficiently compute large deviation functions, used in statistical physics to characterise the fluctuations of nonequilibrium systems, modelled as Markov processes. The method, called LDSTOP, combines numerical techniques from control theory and machine learning to iteratively construct the "driven process", a controlled version of the Markov process used as a model of nonequilibrium system that realises a given fluctuation or large deviation of that system in an optimal way. Compared to other methods based on spectral approximations, importance sampling, cloning or splitting, LDSTOP is simple, flexible, and scalable, as it works by simulating single trajectories that are gradually guided towards the driven process. Here, we illustrate these advantages by applying the method on the full range of Markov processes considered in applications, namely, discrete-time Markov chains, continuous-time jump processes, and diffusion processes. For each type, we define the objective function to be optimised, explain different options available for representing the driven process (using, e.g., neural networks), and provide implementation details through simple applications. With these contributions, we aim to showcase the method's efficiency, as well as its ease of use when combined with available machine learning packages, such as PyTorch, TensorFlow and JAX, for simulating stochastic processes and solving high-dimensional optimisation problems.
ER -