Equilibrium-Gain Sentinel
Source paper: Exposing the Invisible: Detecting Stealthy Parameter-Based Cyber-Attacks on Inverter Synchronization Loops arXiv:2608.30574 ⓘ · analyzed Sep 1, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Add a low-dimensional, trusted sentinel state to the optimizer or recurrent inference controller. The sentinel is driven by a secret probe and a protected gain, so unauthorized gain changes produce a predictable shift in its equilibrium even when the main neural dynamics remain numerically stable. Monitor the estimated equilibrium and trigger rollback or quarantine when the measured shift exceeds the expected noise envelope.
Formulas
Mathematical statement
The paper's mechanism is equilibrium-based exposure of a parameter change: a controller can remain stable while gain tampering changes its steady state. The neural adaptation uses the scalar sentinel dynamics \(\dot{s}=-a s+a k q\), where \(s\) is the monitored state, \(a>0\) is a known relaxation rate, \(k\) is a protected controller gain, and \(q\) is a bounded secret probe. For constant \(q\), the unique equilibrium is \(s^*=kq\) and the perturbation \(\tilde{s}=s-s^*\) obeys \(\dot{\tilde{s}}=-a\tilde{s}\), so the equilibrium error decays exponentially while the system remains stable. In discrete time, \(s_{t+1}=(1-\alpha a)s_t+\alpha a k q_t\) is stable for \(0<\alpha a<2\); for constant \(q\), \(s^*=kq\). A gain attack \(k'=k+\Delta k\) produces the measurable shift \(\Delta s^*=q\Delta k\). With probe variation, estimate \(k\) by least squares from the equilibrium relation \(s^*/q=k\) and compare it to the protected reference.
Implementation notes
Integrate the sentinel at the optimizer-controller boundary, not inside every neural layer. For Adam or SGD, let the protected gain \(k_0\) be the nominal learning-rate multiplier, momentum gain, gradient-clipping gain, or recurrent-state feedback gain; keep a copy of \(k_0\) in a trusted configuration area. At every update, generate a small bounded probe \(q_t\) from a seeded pseudorandom sequence, preferably with zero mean and occasional nonzero amplitudes, and update the sentinel with s = (1-alpha*a)*s + alpha*a*k0*q. Do not use \(s\) to modify the model on the first experiment; only log it and estimate the equilibrium relation. Pseudocode is: q=secret_probe(t); s=(1-alpha*a)*s+alpha*a*k*q; if t>=warmup: append(q,s); khat=sum(q*s)/sum(q*q); residual=abs(khat-k0); alarm=residual>threshold. The stability condition \(0<alpha*a<2\) is computed analytically. Equilibrium, regression variance, and the alarm threshold are estimated empirically from a sliding window; \(k_0\) and the probe seed are protected inputs. First test on a small MLP trained on MNIST with SGD and Adam, comparing an untampered run against attacks that multiply the learning rate or momentum coefficient by \(0.8\), \(1.2\), and \(2.0\) after convergence. Use window lengths of 100-1000 steps and sentinel relaxation values satisfying \(alpha*a=0.2\). The quantitative prediction is that after a transient of roughly \(5/a\), the estimated equilibrium changes by \(q\Delta k\) and the estimated gain converges to the tampered value; detection delay should scale as \(O(a^{-1})\), while choosing \(alpha*a\geq2\) should produce sentinel oscillation or divergence. Measure whether the empirical stability boundary agrees with \(alpha*a=2\) within 10% and whether a 20% gain attack is detected before a comparable loss degradation occurs.
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.