Partitioned Gain-Phase Stable Neural Feedback
Implementation & benchmark of arXiv:2608.03641 — Partitioned Mixed Small Gain-Phase Decentralized Stability Criterion for Power Systems
Source paper: Partitioned Mixed Small Gain-Phase Decentralized Stability Criterion for Power Systems arXiv:2608.03641 ⓘ · analyzed Aug 31, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Build a recurrent or equilibrium network as a feedback interconnection of heterogeneous blocks, certifying some blocks through induced-gain bounds and others through phase or sector bounds. This avoids imposing a uniformly small Lipschitz constant on all blocks: dissipative or strongly contractive blocks use gain certificates, while approximately skew, oscillatory, attention-like, or state-space blocks use phase certificates. The network is accepted only when the local certificates satisfy the pointwise mixed condition on a frequency grid.
Formulas
Mathematical statement
Let the linearized or explicitly linear state-space blocks in a feedback loop have stable transfer matrices H_1(z) and H_2(z). For a gain-certified pair, define g_i(omega) as the largest singular value of H_i at frequency omega. The small-gain certificate is g_1(omega) g_2(omega) < 1 for every frequency. For a phase-certified pair, let phi_i^+(omega) and phi_i^-(omega) denote upper and lower numerical-range phase bounds, with the relevant transfer matrices satisfying the required sector assumptions. The small-phase certificate is phi_1^+(omega) + phi_2^+(omega) < pi and phi_1^-(omega) + phi_2^-(omega) > -pi. In a neural implementation, partition feedback blocks into a gain set G and a phase set P, enforce gain inequalities for gain-paired paths and phase inequalities for phase-paired paths, and monitor the worst margin. Stability is predicted to fail first when the worst-case gain product reaches one or the worst-case phase sum reaches plus or minus pi.
Implementation notes
1. Integration point: use the certificate as a structural constraint for a deep equilibrium model, linear state-space model, or RNN represented as a feedback interconnection. Represent each block with state-space matrices A_i, B_i, C_i, and D_i, or estimate its local input-output Jacobian along minibatch trajectories. Assign ordinary MLP or tanh blocks with gain bounds to the gain partition G. Assign blocks designed with positive-real, skew-symmetric, or damped-oscillatory dynamics to the phase partition P. 2. Pseudocode: create a logarithmic frequency grid Omega. For every block and frequency, compute H_i(exp(j omega)) = C_i (exp(j omega) I - A_i)^(-1) B_i + D_i. Compute g_i as the largest singular value. Estimate phase-sector bounds from numerical-range samples v^* H_i v divided by v^* v, or use a cheaper singular-vector phase approximation. Add a penalty L_cert equal to the sum of squared positive violations of the gain and phase inequalities, and add lambda times L_cert to the task loss. Reject equilibrium solves when the worst margin is negative. 3. The gain and phase inequalities are taken from the paper; transfer functions, frequency responses, and phase bounds are computed or estimated for the neural blocks. For nonlinear networks, estimate local Jacobians over held-out trajectories and use the maximum observed violation as a robust surrogate. 4. First experiment: compare a four-block deep equilibrium network on sequential MNIST and on synthetic long-horizon oscillatory regression against spectral-normalized and unconstrained baselines. Sweep a scalar feedback gain alpha multiplying one block. Measure the predicted critical value alpha_c at which the maximum gain product reaches one, or the maximum phase sum reaches pi. The falsifiable prediction is that exploding fixed-point iterations, increasing Jacobian spectral radius, or loss divergence begins within twenty percent of the certificate boundary, while the mixed partition remains stable in cases rejected by an all-small-gain design.
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 deterministic frequency-grid certificate prototype with gain and phase margins, mixed partitioning, and feedback-iteration checks. The gain boundary and both phase boundaries matched predictions exactly (alpha_c=1.0 and phase sums ±pi), and the mixed certificate accepted a high-gain phase pair rejected by small-gain. However, that phase pair's feedback iteration diverged by 2^20, demonstrating that phase inequalities alone are not sufficient without the required sector/positive-real assumptions; those assumptions and a neural-network experiment were not implemented, so the promised stability effect was not established.
- Agent confidence
- 9/10
- Baseline
- Unconstrained feedback factor q=1.30: final error 36118.86 after 40 iterations.
- Idea
- Clipped gain-certified factor q=0.95: final error 0.1285 after 40 iterations; gain prediction 1.0 observed exactly; phase boundaries predicted ±3.14159265 and observed exactly; mixed phase pair had gain product 2.0 and was accepted by phase but diverged under iteration.
Limitations: This is a scalar toy rather than an RNN, DEQ, SSM, or sequential-MNIST task. The phase example does not enforce or verify positive-real/sector assumptions, so it intentionally exposes the certificate's failure outside its hypotheses. No wall-clock, FLOP, generalization, CUDA, or learned-model comparison was tested.
How to run: python3 partitioned_feedback_experiment.py
Verdict computed by deterministic test code from paired-seed statistics — not by the language model.
Artifacts
- partitioned_feedback_experiment.py 6.8 KB View Raw
- report.md 1.6 KB View
- results.json 31.3 KB View Raw