Nonreversible Gauge Fields in Fokker--Planck Dynamics: Supersymmetric Hamiltonians and Learned Finite Forces
Not on the map. Why?
Abstract (arXiv)
We formulate stationary-density-preserving nonreversible perturbations of Fokker--Planck dynamics as gauge fields that deform relaxation spectra while leaving the invariant state fixed. When detailed balance holds, a similarity transformation maps the reversible Fokker--Planck operator to a Witten-Laplacian-type supersymmetric Hamiltonian; nonreversible gauges then appear as non-Hermitian perturbations that preserve the zero mode but modify the excited spectrum. This operator viewpoint gives a common language for relaxation gaps, circulating probability currents, hypocoercive acceleration, and finite control costs. We represent admissible gauge currents by antisymmetric tensor fields and identify the detailed-balance-violating Ohzeki--Ichiki force as a constant symplectic example whose infinite-strength limit is Hamiltonian dynamics. The continuous-time spectral gap alone does not select a finite gauge strength, so we introduce a finite-time regularized objective and an actor--critic procedure for learning the gauge. An exactly solvable anisotropic Gaussian Ornstein--Uhlenbeck benchmark separates the spectral transition from the finite-time optimum and shows that the learned gauge recovers the Lyapunov-equation optimum. A double-well benchmark then illustrates the same constrained selection in a nonconvex metastable landscape. Stochastic gradient methods enter this framework as physically relevant Fokker--Planck systems: mini-batch noise acts as an effective diffusion tensor, and adaptive methods such as Adam correspond to metric choices with possible nonequilibrium currents.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 54 references that are in the map. First posted on arXiv 4 Jun 2026.
Builds on
28 of 54 references.
References · 28
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 905
- 2019On the Convergence of Adam and Beyondcited by 841
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2018An Empirical Model of Large-Batch Trainingcited by 281
- 2017Three Factors Influencing Minima in SGDcited by 273
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 265
16 more
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
- 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
- 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 135
- 2017Improving Generalization Performance by Switching from Adam to SGDcited by 125
- 2020On the Generalization Benefit of Noise in Stochastic Gradient Descentcited by 82
- 2017Generalizing Hamiltonian Monte Carlo with Neural Networkscited by 52
- 2018Fluctuation-dissipation relations for stochastic gradient descentcited by 48
- 2017A-NICE-MC: Adversarial Training for MCMCcited by 38
- 2021The effective noise of Stochastic Gradient Descentcited by 25
- 2022Stochastic gradient descent introduces an effective landscape-dependent regularization favoring flat solutionscited by 22
- 2016Improving the convergence of reversible samplerscited by 8
- 2021On Large Batch Training and Sharp Minima: A Fokker-Planck Perspectivecited by 5
- 2015Mathematical understanding of detailed balance condition violation and its application to Langevin dynamicscited by 3
- 2015Stochastic gradient method with accelerated stochastic dynamicscited by 1
- 2026SGD at the Edge of Stability: The Stochastic Sharpness Gapcited by 1
Built on by
Not cited yet.