Lyapunov-Margin Noise Scaling
Implementation & benchmark of arXiv:2607.09127 — On robustness, input-to-state stability and backstepping for stochastic differential equations
Source paper: On robustness, input-to-state stability and backstepping for stochastic differential equations arXiv:2607.09127 ⓘ · analyzed Aug 30, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Treat stochastic optimization as a perturbed stochastic dynamical system and adapt the magnitude of gradient noise, minibatch error, or parameter perturbations using an estimated Lyapunov decay margin. Perturbations may remain larger far from a solution, but their allowed magnitude is reduced when the local stability margin becomes small, implementing the paper's state-dependent robustness and stochastic input-to-state stability mechanism.
Formulas
Mathematical statement
For the stochastic differential equation d x = f(t,x) d t + g(t,x) d w, where x is the state, f is the drift, g is the diffusion matrix, and w is Brownian motion, the infinitesimal generator of a twice differentiable Lyapunov function V is L V = grad(V)^T f + one-half times trace(g g^T Hessian(V)). Assume the nominal dynamics satisfy L V <= -c V, where c is a positive decay rate. Add a perturbation B(x)u to the drift and suppose abs(grad(V)^T B(x)u) <= k(x)V. The perturbed system retains a negative Lyapunov drift whenever k(x) < c; uniformly bounded k(x) <= k_bar < c preserves exponential decay. For neural optimization, use V(theta) = one-half times ||theta - theta_star|| squared, where theta is the parameter vector and theta_star is a moving reference checkpoint. Estimate the nominal decay c and perturbation-induced growth q online, then constrain the noise scale so that q times the noise scale remains below a safety fraction of c.
Implementation notes
Integrate the mechanism at the optimizer step. Use SGD or Adam as the nominal update and inject Gaussian parameter noise according to the estimated Lyapunov margin. First maintain a reference checkpoint theta_star, refreshed only after a validation improvement or every fixed number of successful epochs. Compute V_t = 0.5 times the squared Euclidean distance between theta_t and theta_star, preferably normalized per layer to prevent large layers from dominating. During a warm-up interval without added noise, fit a rolling regression of delta V_t on V_t; the negative slope estimates the nominal decay rate c_hat_t. Estimate q_hat_t with matched minibatch probes: apply the same gradient update twice, once without noise and once with a unit-scale Gaussian perturbation, and divide the resulting excess increase in V by the probe scale. Then update theta using theta_{t+1} = theta_t - eta_t times g_hat_t + sigma_t times xi_t, where xi_t is standard Gaussian noise, and set sigma_t using the displayed rule with safety factor rho = 0.5. Smooth c_hat and q_hat with exponential moving averages and clip sigma. The paper provides the Lyapunov and ISS argument; the checkpoint-centered V, decay estimate, and perturbation estimate are empirical approximations. The first cheap experiment should use a two-layer MLP on MNIST, comparing no noise, fixed noise, and adaptive noise. Sweep fixed noise amplitudes and define divergence as a nonnegative long-run slope of V. Prediction: the fixed-noise stability boundary occurs near q_hat times sigma = c_hat times V, while the adaptive method should keep the fitted slope of delta V negative and close to minus (1 minus rho) times c_hat.
Verification
Stage 1 · Toy mechanism gate: Failed ✗
Stage 2 · Mechanism transferred to benchmark: Not tested
Stage 2 · Practical benchmark result: Not run
Methodology: Toy-system gate first; the benchmark stage runs only after a pass. How verification works
Stage 1 — Mechanism check agent confidence 9/10
Built a reproducible Lyapunov-margin noise controller prototype, an analytic scalar stability sweep, and a small digits MLP comparison. The toy sweep confirmed the predicted fixed-noise boundary sigma=lambda with mean absolute grid error 0.005, but the adaptive rule did not satisfy its quantitative prediction: its mean sigma error versus 0.5*lambda was 0.171 and it became unstable at lambda=0.8. In the MLP test, adaptive noise matched baseline accuracy and nearly matched log loss, but showed no meaningful win, so the mechanism is not validated overall.
- Agent confidence
- 9/10
- Baseline
- Digits MLP: accuracy=0.9267, logloss=0.25798, final V=0.002533, last-10 V slope=-0.0002571
- Idea
- Digits adaptive noise: accuracy=0.9267, logloss=0.25815, final V=0.002526, last-10 V slope=-0.0002585; toy boundary predicted/observed mean absolute error=0.005, adaptive sigma mean error=0.171, adaptive stability failed at lambda=0.8
Limitations: Only one deterministic seed and one small digits MLP were tested; no MNIST, Adam, repeated-seed confidence intervals, validation-based checkpoint policy, minibatch probe implementation, GPU run, or hyperparameter optimization was evaluated.
How to run: python3 experiment.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Artifacts
- experiment.py 4.9 KB View Raw
- report.md 1.4 KB View
- results.json 2.9 KB View Raw