Papers › A machine learning approach to fast thermal equilibration
A machine learning approach to fast thermal equilibration
Diego Rengifo, Gabriel Téllez
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections