Unverified 2026

Singular-gap controlled stochastic optimizer

Implementation & benchmark of arXiv:2607.10801 — Relaxation times of non-reversible Markov processes

Usefulness6/10
Difficulty6/10
Novelty7/10

Source paper: Relaxation times of non-reversible Markov processes arXiv:2607.10801 ⓘ · analyzed Aug 30, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Treat a stochastic optimizer as a Markov transition kernel and monitor its contraction on mean-zero observables using singular values, which remains meaningful for non-reversible momentum dynamics. Adapt optimizer hyperparameters online to maximize an empirical singular-value gap, suppressing oscillatory modes that can have small eigenvalue gap but poor transient relaxation.

Formulas

$$ (P_t f)(x)=\int f(y)\,p_t(x,\mathrm{d}y),\qquad \int_S P_t f\,\mathrm{d}\mu=\int_S f\,\mathrm{d}\mu. $$
$$L^2_0(\mu)=\left\{f\in L^2(\mu):\int f\,\mathrm{d}\mu=0\right\},\qquad \|f\|^2=\int f^2\,\mathrm{d}\mu.$$
$$s(P)=\sup_{f\in L^2_0(\mu),\,\|f\|=1}\|Pf\|=\sqrt{\lambda_{\max}\!\left(P^*P\big|_{L^2_0(\mu)}\right)},\qquad \gamma(P)=1-s(P).$$
$$\bar P_K=\frac1K\sum_{k=0}^{K-1}P^k,\qquad s(\bar P_K)=\sup_{\|f\|=1,\,f\in L^2_0(\mu)}\|\bar P_Kf\|.$$

Mathematical statement

The paper starts with a Markov transition semigroup $(P_t)_{t\geq 0}$ preserving an invariant probability measure $\mu$, where $(P_tf)(x)=\int f(y)p_t(x,\mathrm{d}y)$ and $\int P_tf\,\mathrm{d}\mu=\int f\,\mathrm{d}\mu$. The centered Hilbert space is $L^2_0(\mu)=\{f:\int f\,\mathrm{d}\mu=0\}$ with norm $\|f\|^2=\int f^2\,\mathrm{d}\mu$. For a discrete optimizer transition operator $P$, define the empirical one-step singular contraction $s=\sup_{f\in L^2_0,\|f\|=1}\|Pf\|$ and singular-value gap $\gamma=1-s$; equivalently estimate the top singular value of $P$ on centered probe functions. For a non-reversible process, $P^*P$ is self-adjoint and $s^2=\lambda_{\max}(P^*P|_{L^2_0})$, so this diagnostic measures worst-case norm contraction without assuming reversibility. Use the time-averaged operator $\bar P_K=K^{-1}\sum_{k=0}^{K-1}P^k$ when one-step dynamics are strongly rotational; its contraction directly measures relaxation of averaged iterates.

Implementation notes

(1) Integrate this into the optimizer hyperparameter controller, not the forward network. Use a stochastic training state $z_k=(\theta_k,m_k)$, where $m_k$ is momentum or Adam state; the optimizer update plus minibatch sampling defines the transition $z_{k+1}\sim P(z_k,\cdot)$. Every $M$ steps, record short windows of $z_k$ or low-dimensional observables $h_j(z_k)$ such as loss, gradient norm, momentum norm, and random parameter projections. Center each observable within the window: $\tilde h_j=h_j-\frac1T\sum_{k=0}^{T-1}h_j(z_k)$. (2) Estimate the action of $P$ by fitting $h_j(z_{k+1})\approx\sum_i A_{ij}h_i(z_k)$ with ridge regression on centered probe vectors. Estimate the probe covariance $C$, whiten with $C^{-1/2}$, and form $A_w=C^{-1/2}AC^{1/2}$; compute $\hat s=\sigma_{\max}(A_w)$ using a small SVD. For a rotational optimizer, compute $\hat A_{avg}=K^{-1}\sum_{r=0}^{K-1}\hat A^r$. (3) The paper-derived quantities are the centered invariant-space restriction, the $P^*P$ singular-value criterion, and the time-averaged operator. The regression matrix, covariance, and finite-dimensional singular value are empirical approximations. If the EMA of $\hat s$ exceeds 0.98, reduce momentum $\beta$ or learning rate $\eta$ by 10%; if it is below 0.90 while loss decreases, increase $\eta$ by 5%. Update only every 500 steps and use a 0.9 EMA to avoid noisy control. (4) First test on a two-layer MLP and small ResNet on MNIST or CIFAR-10, comparing fixed tuned SGD-momentum and AdamW against the controller. Measure loss and validation accuracy at equal steps and wall-clock, gradient spikes, oscillation of loss, and $\hat s$. The hypothesis is that the singular gap predicts transient instability better than eigenvalue-style autocorrelation, yielding at least 10% lower loss after 5,000 steps or 20% fewer steps to a target accuracy without material probe overhead.

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.