Trajectory-Dissipation Learning-Rate Controller
Implementation & benchmark of arXiv:2608.23394 — Free-Energy Differences from Nonequilibrium Fluctuations in High Dissipation
Source paper: Free-Energy Differences from Nonequilibrium Fluctuations in High Dissipation arXiv:2608.23394 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Augment SGD or Adam with a short-window estimate of optimizer trajectory entropy production obtained from forward and reverse minibatch or noise paths. Reduce the learning rate when estimated dissipation rises sharply, and increase it only when dissipation remains controlled, avoiding the rare-event sensitivity of exponential work estimators.
Formulas
Mathematical statement
Let a training trajectory be $\Gamma=(\theta_0,\theta_1,\ldots,\theta_T)$, with forward path density $P_F[\Gamma]$ induced by the optimizer and data/noise sequence, and reversed path density $P_R[\Gamma^\dagger]$ induced by the time-reversed schedule and reversed minibatch/noise sequence. The trajectory entropy production is $\Sigma[\Gamma]=\log(P_F[\Gamma]/P_R[\Gamma^\dagger])$. For a driven stochastic process, mean work decomposes as $\langle W\rangle=\Delta F+\beta^{-1}\langle\Sigma\rangle$, where $\beta$ is inverse effective temperature and $\Delta F$ is the equilibrium-potential difference. Estimate $\langle\Sigma\rangle$ from repeated paired trajectories instead of estimating $\langle e^{-\beta W}\rangle$, whose variance is dominated by rare negative-dissipation paths. Use the empirical dissipation rate $d_t=\widehat{\langle\Sigma\rangle}/T$ as feedback, targeting $d_t\le d_{\max}$, where $d_{\max}$ is a chosen stability threshold.
Implementation notes
(1) Integrate the controller around SGD or Adam, without changing the network or loss. Every control interval of $T=20$ to $100$ updates, save parameter increments, minibatch identities, gradient estimates, and optimizer noise. Construct $K$ reverse surrogates by replaying the same minibatches in reverse order, applying the optimizer schedule backward, and using reversed Gaussian noise when available. For Gaussian update noise with covariance $C_s$, estimate each path log-density from the observed increment $\delta_s=\theta_{s+1}-\theta_s$ using $\log P_s(\delta_s)=-\frac12(\delta_s-m_s)^\top C_s^{-1}(\delta_s-m_s)-\frac12\log\det(2\pi C_s)$, where $m_s$ is the optimizer-predicted mean update and diagonal $C_s$ is estimated from recent update residuals. (2) Pseudocode: collect $K$ forward windows; compute forward and reverse Gaussian log probabilities; set $\widehat d=(KT)^{-1}\sum(\log P_F-\log P_R)$; update $\eta\leftarrow\operatorname{clip}(\eta e^{-\kappa(\widehat d-d_{\max})})$; continue training. (3) The fluctuation-theorem identity and dissipation interpretation come from the paper; path probabilities, effective temperature, covariance, and $d_{\max}$ are estimated empirically. Use block-bootstrap confidence intervals and freeze the controller when uncertainty is high. (4) First test: train an MLP and 2-layer CNN on MNIST or CIFAR-10, comparing fixed learning rates, cosine decay, and this controller across the fixed-step divergence region. The quantitative prediction is that $\widehat d_t$ rises before loss explosion, and controlling it extends the maximum stable learning rate. With $K=32$ and $T=50$, require the detected dissipation-rise point to precede loss explosion by at least 5 updates and reproduce the baseline stability boundary within 20%.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.