Convolution-Calibrated Persistent-Noise Optimizer
Implementation & benchmark of arXiv:2608.21781 — Nonequilibrium statistics of harmonically trapped run-and-tumble particles: An exact convolution approach
Source paper: Nonequilibrium statistics of harmonically trapped run-and-tumble particles: An exact convolution approach arXiv:2608.21781 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Add a persistent two-state force to a locally stable optimizer while retaining Gaussian minibatch or Langevin noise. In a locally quadratic basin, the parameter-error distribution should be the convolution of a compact-support run-and-tumble stationary law and an Ornstein-Uhlenbeck Gaussian. This supplies an explicit persistence and noise calibration rule instead of treating all optimizer noise as white and Gaussian.
Formulas
Mathematical statement
For one parameter direction with local curvature lambda greater than zero, use dtheta/dt = -mu lambda theta + v sigma(t) + xi(t), where theta is parameter error, mu is positive mobility, v is persistent-force magnitude, sigma belongs to {-1,+1} and flips at rate alpha/2, and xi is Gaussian white noise with covariance 2 D_T delta(t-t'). The athermal stationary law has support |theta| less than a, with a = v/(mu lambda), and density proportional to [1-(theta/a)^2]^(r-1), where r = alpha/(2 mu lambda). Thermal noise contributes the Ornstein-Uhlenbeck kernel with variance s_T squared = D_T/(mu lambda). The complete stationary law is their convolution. The dimensionless ratios r and chi = D_T/(v^2/alpha) predict the shape crossover: small r and chi produce boundary-peaked non-Gaussian fluctuations, whereas large r or chi produces a Gaussian-like distribution.
Implementation notes
Integrate the mechanism into SGD, Adam, or Langevin SGD inside a trust region, initially on one parameter block or a low-dimensional projection. Estimate a local curvature lambda using a Hessian-vector product, diagonal Gauss-Newton estimate, or finite-difference curvature. Maintain one persistent sign sigma per block. At step k with duration h, flip sigma with probability 1 - exp(-alpha h/2), compute the minibatch gradient g, and update theta by theta <- theta + h(-mu g + v sigma) + sqrt(2 D_T h) epsilon, where epsilon is standard normal noise. Use gradient clipping or a trust-region projection to prevent the persistent force from leaving the local basin. The paper provides the stationary run-and-tumble density and its Ornstein-Uhlenbeck convolution; curvature, effective thermal noise D_T, and the validity of the quadratic approximation must be estimated from training trajectories. The first cheap experiment should use a one-dimensional and two-dimensional quadratic loss, followed by a small MLP on MNIST. Compare SGD, Gaussian Langevin SGD, and persistent-noise SGD at matched total variance. Record parameter histograms after equilibration and fit both the predicted convolution and a Gaussian. The quantitative prediction is that the convolution fit wins at small r or chi, while the histogram becomes Gaussian-like when r or chi is large. The measured variance should match a^2/(2r+1) + D_T/(mu lambda) within 20 percent. For the discrete deterministic part, instability should begin when |1-h mu lambda| reaches one, with the upper boundary h mu lambda = 2.
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.