Search arXivSearch

arXiv · 2504.08080

A machine learning approach to fast thermal equilibration

Abstract

We present a method to design driving protocols that achieve fast thermal equilibration of a system of interest using techniques inspired by machine learning training algorithms. For example, consider a Brownian particle manipulated by optical tweezers. The force on the particle can be controlled and adjusted over time, resulting in a driving protocol that transitions the particle from an initial state to a final state. Once the driving protocol has been completed, the system requires additional time to relax to thermal equilibrium. Designing driving protocols that bypass the relaxation period is of interest so that, at the end of the protocol, the system is either in thermal equilibrium or very close to it. Several studies have addressed this problem through reverse engineering methods, which involve prescribing a specific evolution for the probability density function of the system and then deducing the corresponding form of the driving protocol potential. Here, we propose a new method that can be applied to more complex systems where reverse engineering is not feasible. We simulate the evolution of a large ensemble of trajectories while tracking the gradients with respect to a parametrization of the driving protocol. The final probability density function is compared to the target equilibrium one. Using machine learning libraries, the gradients are computed via backpropagation and the protocol is iteratively adjusted until the optimal protocol is achieved. We demonstrate the effectiveness of our approach with several examples.

Explore related subjects

Keep this discovery

BibTeXRIS

Diego Rengifo, Gabriel Téllez. 2025-04-10. A machine learning approach to fast thermal equilibration. https://arxiv.org/abs/2504.08080

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech

Information-Theoretic Characterization of Macroscopic Chaos Emerging from the Chemical Master Equation

Open chemical reaction networks exhibit stochastic concentration dynamics at finite system sizes, whereas their macroscopic limit is governed by deterministic rate equations that can display chaos. In this Letter, we show theoretically that a rate of information loss constructed from two-time mutual information recovers the Kolmogorov-Sinai entropy in the deterministic limit. We verify this result through numerical simulations of a Markov jump process for a three-species system involving seven reactions.

cond-mat.stat-mech

Orientational order on non-orientable domains

We study the statistical properties of passive and active many-body systems with orientational degrees of freedom on non-orientable domains. By rephrasing topological constraints as non-local symmetry relations on an orientable double-cover, we show that non-orientability eliminates global rotational soft modes without acting like an external field. In a passive XY model, this results in topological caging, where orientational fluctuations that exhibit conventional diffusive behavior on a torus saturate on a Klein bottle to a finite value that we compute exactly in the thermodynamic limit. In models of active self-propelled particles with orientational degrees of freedom, topological caging persists despite continuously changing interaction neighborhoods. In an active Ising spin model, non-orientability enforces the coexistence of ordered anti-parallel domains with vanishing global polar order, a state that is absent on orientable domains.

cond-mat.stat-mech