✗ Failed on benchmark 2026

Spectral-Gated Parallel Best Responses

Implementation & benchmark of arXiv:2608.27623 — Competitive One-Step-Ahead Control of Friedkin--Johnsen Networks: Potential Games, Stability, and the Price of Competition

Usefulness7/10
Difficulty5/10
Novelty7/10

Source paper: Competitive One-Step-Ahead Control of Friedkin--Johnsen Networks: Potential Games, Stability, and the Price of Competition arXiv:2608.27623 ⓘ · analyzed Sep 1, 2026

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

Idea description

Partition neural-network parameters into competing blocks, such as LoRA adapters, mixture-of-experts heads, or task-specific heads, and update each block by minimizing its local quadratic model while holding the other blocks fixed. Use the exact Jacobi coupling spectral radius to decide whether simultaneous updates are stable; near the boundary, apply damping or fall back to sequential Gauss-Seidel updates.

Formulas

$$\Phi(z)=\frac{1}{2}z^{\mathsf T}Hz-r^{\mathsf T}z,\qquad H=H^{\mathsf T}\succ0,\qquad \nabla\Phi(z)=Hz-r.$$
$$z^{t+1}_{\mathrm{par}}=D^{-1}(r-Ez^t),\qquad e^{t+1}=-D^{-1}Ee^t,\qquad \text{parallel convergence}\Longleftrightarrow\rho(D^{-1}E)<1.$$
$$z^{t+1}=(1-\alpha)z^t+\alpha D^{-1}(r-Ez^t),\qquad \rho\!\left((1-\alpha)I-\alpha D^{-1}E\right)<1.$$

Mathematical statement

Let $z=(z_1,\ldots,z_p)$ denote parameter blocks and let the local training objective around the current iterate be $\Phi(z)=\frac{1}{2}z^{\mathsf T}Hz-r^{\mathsf T}z$, where $H=H^{\mathsf T}\succ0$ and $r$ is the local gradient-derived vector. Partition $H=D+E$, where $D=\operatorname{blkdiag}(H_{11},\ldots,H_{pp})$ contains within-block Hessian blocks and $E$ contains cross-block couplings. The exact parallel best-response iteration is $z^{t+1}=D^{-1}(r-Ez^t)$, with error dynamics $e^{t+1}=-D^{-1}Ee^t$. It converges for every initialization if and only if $\rho(D^{-1}E)<1$, and its asymptotic contraction factor is $\rho(D^{-1}E)$. A damped update has iteration matrix $M_{\alpha}=(1-\alpha)I-\alpha D^{-1}E$ and is stable when $\rho(M_{\alpha})<1$. Here $\rho(\cdot)$ is spectral radius, $\alpha$ is the damping coefficient, $D$ is the block-diagonal curvature, and $E$ is the cross-block curvature.

Implementation notes

First, integrate the mechanism as an inner optimizer for a network whose trainable parameters are divided into blocks, for example four LoRA adapters attached to the same transformer layer, or four experts trained on partially conflicting routing losses. During each outer minibatch, freeze activations and form a block-local quadratic model from the current gradient and a cheap curvature approximation. For block $i$, use a diagonal, Kronecker-factored, or low-rank approximation $H_{ii}$; estimate cross-block products $H_{ij}v$ with Hessian-vector products instead of constructing the full Hessian. Pseudocode: compute each block gradient $g_i$ and curvature blocks; set $D=\operatorname{blkdiag}(H_{ii})$ and implement $E=H-D$ as a Hessian-vector-product operator; estimate $\widehat{\rho}=\rho(D^{-1}E)$ using 5 to 20 power iterations; if $\widehat{\rho}<0.8$, execute simultaneous updates $z_i\leftarrow[D^{-1}(r-Ez)]_i$; if $0.8\leq\widehat{\rho}<1$, use damping with $\alpha$ selected from $\{0.1,0.25,0.5,0.75\}$; if $\widehat{\rho}\geq1$, execute blocks sequentially or increase within-block regularization via $H_{ii}\leftarrow H_{ii}+\lambda I$. The exact paper mechanism is the Jacobi stability condition; neural-network curvature and spectral radius are empirical estimates, so log both $\widehat{\rho}$ and the actual quadratic residual norm $\|Hz-r\|$. The first cheap experiment should use a two-layer MLP on MNIST with two parameter blocks and a tunable cross-block penalty $\gamma$ in $L=L_1+L_2+\gamma\langle z_1,z_2\rangle$. Compare Adam, parallel best response, damped best response, and sequential best response. The falsifiable prediction is a sharp divergence or oscillation transition when $\widehat{\rho}(D^{-1}E)$ crosses one: below one, inner residuals decay geometrically with slope approximately $\log\widehat{\rho}$; above one, simultaneous updates fail while sequential updates remain stable. The measured stability boundary should agree with the spectral prediction within approximately 20 percent.

Verification

Failed on benchmark

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗

Stage 2 · Practical benchmark result: Significantly worse ✗

Methodology: 8 paired seeds, permutation test (p<0.05) against a learning-rate-tuned baseline. How verification works

Stage 1 — Mechanism check agent confidence 9/10

Built and numerically verified Spectral-Gated Parallel Best Responses on a three-block SPD quadratic, including parallel Jacobi, damped Jacobi, sequential Gauss-Seidel, Adam, and a spectral gating policy. The predicted stability boundary rho=2gamma at gamma=0.5 was observed exactly: residuals decay below the boundary and grow above it, while measured contraction ratios matched rho at gamma=0.30 (0.600 vs 0.600) and gamma=0.49 (0.980 vs 0.980). Damping with alpha=0.5 stabilized gamma=0.9 (matrix radius 0.95, residual 4.3e-5 after 200 steps), while undamped parallel updates diverged (residual 7.0e9 after 40 steps).

Agent confidence
9/10
Baseline
Adam residual after 40 steps: 0.0532, 0.0792, 0.1064, 0.0917, 0.1400, 0.5266 for gamma=0.1, 0.3, 0.49, 0.51, 0.7, 0.9 respectively.
Idea
Gated policy residual after 40 steps: 2.3e-16, 5.8e-10, 9.4e-6, 5.6e-17, 9.6e-10, 2.25e-3 for the same gamma values; it selects parallel for rho<0.8, damping for 0.8<=rho<1, and sequential for rho>=1.

Limitations: This is an exact low-dimensional quadratic verification rather than a neural-network or MNIST experiment. Cross-block curvature is constructed analytically rather than estimated with Hessian-vector products, and runtime/FLOP overhead of spectral estimation and gating was not measured.

How to run: python3 spectral_gated_experiment.py

Stage 2 — Benchmark vs. tuned baseline (arXiv:2608.27623)

Significantly WORSE than the tuned baseline (+819.4%, p=0.0081, wins 0 / 8 paired seeds).

Benchmark
Tabular regression (Friedman)
Model
mlp_tiny
Paired seeds
8
Baseline mean
10.6786
Idea mean
98.1757
Effect (Δ)
87.497 (+819.4%; negative = idea better)
Wins
0 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
Hurts
Baseline tuning
swept over 0 configs
Limitations:

Only tabular/Friedman#1 with mlp_tiny was tested. The neural coupling estimate was a gradient-norm heuristic rather than exact Hessian-vector-product spectral estimation. Runtime/FLOP overhead, larger models, and the other benchmark tracks were not tested.

How to run: python3 bench_experiment.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Stage 2 — Benchmark latest Failed ✗

Agent confidence: 9/10

Implemented Spectral-Gated Parallel Best Responses as a blockwise optimizer on the structurally matched tabular Friedman#1 track with mlp_tiny. Across 8 paired seeds, tuned Adam achieved test MSE 10.6786 while the best idea configuration achieved 98.1757; paired delta was +87.4970 with permutation p=0.0081, so the idea was significantly worse. The NN-scale heuristic mechanism signature was not confirmed.

Baseline
Tuned Adam, lr=0.006 and weight_decay=0.0001: mean test MSE 10.6786, std 1.2287.
Idea
Best gated blockwise update, lr=0.006, reg=0.02, alpha=0.5: mean test MSE 98.1757, std 15.0264; delta +87.4970; p=0.0081; 0/8 wins.

Benchmark result

Significantly WORSE than the tuned baseline (+819.4%, p=0.0081, wins 0 / 8 paired seeds).

Benchmark
Tabular regression (Friedman)
Model
mlp_tiny
Paired seeds
8
Baseline mean
10.6786
Idea mean
98.1757
Effect (Δ)
87.497 (+819.4%; negative = idea better)
Wins
0 / 8 paired seeds
p-value
0.0081 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
Hurts
Baseline tuning
swept over 0 configs
Limitations:

Only tabular/Friedman#1 with mlp_tiny was tested. The neural coupling estimate was a gradient-norm heuristic rather than exact Hessian-vector-product spectral estimation. Runtime/FLOP overhead, larger models, and the other benchmark tracks were not tested.

How to run: python3 bench_experiment.py

Artifacts

Implementation overview ⬇ Download all as ZIP 6 files · code, reports and structured results