✗ Failed on benchmark 2026

Cycle-aware softmax temperature control

Implementation & benchmark of arXiv:2607.18128 — Feedback Cycles in Exploratory Equilibria

Usefulness8/10
Difficulty6/10
Novelty6/10

Source paper: Feedback Cycles in Exploratory Equilibria arXiv:2607.18128 ⓘ · analyzed Aug 30, 2026

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

Idea description

Use an online estimate of the positive feedback gain among logits, routing probabilities, and representations to adjust the softmax temperature. Increase temperature when the estimated cyclic gain approaches the instability regime, preventing exponential amplification and router collapse without globally weakening all layers.

Formulas

$$\frac{v}{\tau}\exp\left\{\left(-\nu I+\frac{v}{\tau}K\right)(T-t)\right\}$$
$$\text{cycle gain rate}\;\approx\;\frac{v\rho(K)}{\tau}-\nu$$
$$p_i=\frac{\exp(z_i/\tau)}{\sum_j\exp(z_j/\tau)},\qquad \tau_{\mathrm{target}}=\max\left(\tau_{\min},\frac{v\rho(K)}{\nu+g_{\mathrm{margin}}}\right)$$
$$\rho(K)\approx\frac{\|Kq\|_1}{\|q\|_1},\qquad q\leftarrow\frac{Kq}{\|Kq\|_1},\quad q\geq0$$

Mathematical statement

The paper gives the tied-policy response $$\frac{v}{\tau}\exp\left\{\left(-\nu I+\frac{v}{\tau}K\right)(T-t)\right\},$$ where $v>0$ is a response scale, $ au>0$ is temperature, $
u>0$ is damping, $I$ is the identity matrix, $K\geq0$ is a nonnegative feedback matrix, and $T-t$ is the remaining horizon. For a positive cycle, the dominant Perron eigenvalue $\rho(K)$ contributes exponential amplification through the matrix exponential; stability is expected when the dominant gain $v\rho(K)/ au-
u$ is nonpositive. In contrast, a directed acyclic graph with longest path $L$ has susceptibility of order $\Theta( au^{-(L+1)})$, because powers of a nilpotent $K$ terminate. For neural logits $z$, probabilities are $p_i=\exp(z_i/ au)/\sum_j\exp(z_j/ au)$. Define $K$ as a nonnegative estimate of the absolute cross-channel Jacobian from current probabilities through the network and back to logits. The transferable control variable is $g=\rho(K)/ au$.

Implementation notes

Integrate this into the logits-to-probabilities operation of a recurrent attention block, iterative token mixer, or MoE router. For each monitored layer, define logits $z\in\mathbb{R}^m$, probabilities $p=\operatorname{softmax}(z/\tau)$, and a small nonnegative feedback proxy $K\in\mathbb{R}_+^{m\times m}$. A practical construction is to retain the previous-step activation $h_{t-1}$, compute the absolute Jacobian-vector effect from probability perturbations to the next logits, and approximate it with $K_{ij}=|\partial z_{t+1,i}/\partial p_{t,j}|$; estimate this using one-sided finite differences on a detached minibatch or one reverse-mode Jacobian-vector product per column block. Every 20-100 optimizer steps, run 3-5 power iterations: initialize positive $q$, repeatedly set $q\leftarrow Kq/(\|Kq\|_1+\epsilon)$, and estimate $\rho(K)=\|Kq\|_1/\|q\|_1$. Set $\tau$ with an EMA controller using $\tau_{target}=\max(\tau_{min},v\rho(K)/(\nu+g_{margin}))$, then update slowly via $\tau\leftarrow(1-\alpha)\tau+\alpha\tau_{target}$, stopping gradients through the controller. Here $v$ is a calibrated response scale, $\nu$ is an explicit damping proxy estimated from residual decay, and $g_{margin}>0$ prevents operation at the boundary. The matrix-exponential stability principle and spectral estimate come from the paper; $K$, $v$, and $\nu$ are empirical engineering proxies. First test on a 6-layer recurrent attention toy transformer and a Switch-style MoE on WikiText-2 or C4, comparing fixed temperatures and standard annealing at equal FLOPs. Track training loss variance, maximum router probability, expert-load entropy, estimated $\rho(K)/\tau$, gradient norm spikes, and validation perplexity. Success means fewer collapse events and lower loss at equal final temperature, with the estimated gain remaining below threshold.

Verification

Failed on benchmark

Stage 1 · Toy mechanism gate: Passed ✓

Stage 2 · Mechanism transferred to benchmark: Not reproduced ✗

Stage 2 · Practical benchmark result: No measurable effect

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 a reproducible cycle-aware temperature-control MVP with power-iteration spectral estimation, stability sweeps, cycle-versus-DAG response tests, and a tiny router comparison. The mechanism predictions manifested: the neutral-temperature boundary was localized to the predicted interval, spectral radius scaled linearly with cycle gain, and cycle response log-growth matched the predicted rate exactly. The adaptive controller reduced routing concentration substantially, but the crude proxy drove temperature to 63.6 and worsened task loss, so this is not yet an end-to-end performance win.

Agent confidence
9/10
Baseline
Fixed tau=1.0: mean last-50 loss 0.00085565, loss std 0.00007541, mean max probability 0.85214, entropy 0.38798.
Idea
Cycle-aware: mean last-50 loss 0.00122579, loss std 0.00014563, mean max probability 0.26392, entropy 1.38530, final tau 63.5758. Math: predicted cycle growth 0.778571 versus observed 0.778571; predicted neutral tau 2.65625, localized on the tested grid to [2.5,2.75].

Limitations: Only a tiny synthetic router was tested, not WikiText-2/C4, a transformer, or a production MoE. The feedback matrix is a crude detached W_abs W_abs^T proxy rather than a measured probability-to-next-logit Jacobian; no temperature cap, calibration, multiple seeds, validation perplexity, or equal-FLOP large-scale comparison was tested.

How to run: python3 cycle_temperature_experiment.py

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

No significant difference vs. the tuned baseline (0.0006 metric points, p=0.9839, wins 3 / 8 paired seeds).

Benchmark
Sequence modeling
Model
transformer_tiny
Paired seeds
8
Baseline mean
0
Idea mean
0.3584
Effect (Δ)
0.0006 (n/a; negative = idea better)
Wins
3 / 8 paired seeds
p-value
0.9839 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
No effect
Baseline tuning
swept over 0 configs
Limitations:

Only the built-in sequence track was tested, using 400 training samples, 200 test samples, 12 epochs, and a tiny local transformer matching the benchmark dimensions. The feedback proxy was weight-based rather than a measured probability-to-next-logit Jacobian, and no production MoE, WikiText-2, C4, longer training, or additional controller calibration was tested.

How to run: python3 cycle_temperature_bench.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

Built and ran the mandatory sequence-track benchmark with a shared tiny transformer, paired seeds, baseline temperature/lr sweep, and a three-setting cycle-aware sweep. The controller did not improve test MSE: baseline mean 0.3577276 versus idea mean 0.3583749, paired delta +0.0006474 with permutation p=0.98385. The analytical stability check passed, but the trained-model mechanism signature was not quantitatively confirmed, so this is not a demonstrated transfer win.

Baseline
8-seed test MSE mean=0.3577275798, std=0.0849603908; best baseline sweep config lr=0.003, tau=1.0; 4-seed sweep mean=0.3051137924.
Idea
Best 8-seed cycle-aware result at lr=0.002, initial tau=1.0: test MSE mean=0.3583749309, std=0.0689927121; paired delta=+0.0006473511; 3/8 wins; permutation p=0.98385.

Benchmark result

No significant difference vs. the tuned baseline (0.0006 metric points, p=0.9839, wins 3 / 8 paired seeds).

Benchmark
Sequence modeling
Model
transformer_tiny
Paired seeds
8
Baseline mean
0
Idea mean
0.3584
Effect (Δ)
0.0006 (n/a; negative = idea better)
Wins
3 / 8 paired seeds
p-value
0.9839 (permutation test, 20 000 shuffles)
Smallest detectable effect
n/a
Mechanism
Not confirmed ✗
Practical effect
No effect
Baseline tuning
swept over 0 configs
Limitations:

Only the built-in sequence track was tested, using 400 training samples, 200 test samples, 12 epochs, and a tiny local transformer matching the benchmark dimensions. The feedback proxy was weight-based rather than a measured probability-to-next-logit Jacobian, and no production MoE, WikiText-2, C4, longer training, or additional controller calibration was tested.

How to run: python3 cycle_temperature_bench.py

Artifacts

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