Pith. sign in

REVIEW 2 cited by

A machine learning approach to fast thermal equilibration

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.08080 v2 pith:3SETR5UT submitted 2025-04-10 cond-mat.stat-mech

classification cond-mat.stat-mech
keywords protocoldrivingsystemthermalequilibriumlearningmachineparticle
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Time-energy tradeoff in stochastic resetting using optimal control

    cond-mat.stat-mech 2025-07 conditional novelty 6.0 of 10

    An optimal transport protocol for a harmonically trapped Brownian particle, with work γΔλ²/tf, sets a lower time-energy bound for finite-time stochastic resetting via Eq. (5).

  2. Benchmark control problems in nonequilibrium statistical mechanics

    cond-mat.stat-mech 2025-06 conditional novelty 5.0 of 10

    NESTbench25 packages five stochastic control benchmark problems with reference implementations and worked neuroevolution and automatic differentiation results, enabling standardized comparison of optimal-protocol methods.

Pith tools