cs.LGJun 30, 2026

Review Residuals: Update-Conditioned Residual Gating for Transformers

Authors: Kyle Kramer

Organizations: NeraTech LLC

Abstract

Residual connections add every sublayer's proposed update with a fixed coefficient of one; the network never evaluates whether an update is reliable before committing it. Drawing on the human-factors principle of independent verification, we introduce Review Residuals, which scale each update by a learned, input-dependent gate conditioned on both the current state and the proposed update: h_l = h_{l-1} + r_l * u_l with r_l = sigmoid(W[RMSNorm(h_{l-1}), RMSNorm(u_l)]). Conditioning the gate on the update is the property that distinguishes it from prior gated and scaled residuals. We report two findings. First, a depth-stability result: a convex (Highway-style) form of the gate reintroduces vanishing gradients and fails to train beyond ~20 layers, whereas the additive, identity-preserving form trains stably at all depths we tested. Second, an emergence-with-scale result: trained from scratch across five sizes (60M-1B parameters, multi-seed), Review Residuals show no advantage at small scale but at 590M significantly outperform both a parameter-matched Highway gate and a parameter-matched standard residual (p<0.05), with a larger advantage at 1B. The benefit grows with model size rather than shrinking.

Explore similar work

May 22, 2026cs.LG

Multi-Gate Residuals

While Attention Residuals has shown some effectiveness in addressing the widespread issue of unbounded activation growth across deep residual layers, it inevitably incurs significant communication overhead. To circumvent this bottleneck, we propose Multi-Gate Residuals (MGR), which stabilizes activation scales without additional communication burden. It utilizes a straightforward scoring and gating mechanism to maintain multi-stream context, coupled with Attention Pooling to extract hidden states from the stream states. Empirical experiments demonstrate that MGR is practical for large-scale training and deployment, offering tangible performance improvements over existing architectures.
Zhizhan Zheng, Feiyun Zhang, Shuchun Liu +4
May 13, 2026cs.LG

Delta Attention Residuals

Attention Residuals replace standard additive residual connections with learned softmax attention over previous layer outputs, enabling selective cross-layer routing. However, standard Attention Residuals still attend over cumulative hidden states in previous layers, which are highly redundant. We show that this redundancy leads to routing collapse in deeper layers: attention weights become low-contrast and closer to uniform (max weight {\approx}0.2), limiting the model's ability to select informative states in previous layers. This raises a key but underexplored design question: what layer-wise representations should be routed in Attention Residuals? To answer this question, we propose Delta Attention Residuals, which attend over deltas -- the change introduced by each sublayer (vi=hi+1hi\mathbf{v}_i = \mathbf{h}_{i+1} - \mathbf{h}_i) -- instead of cumulative states. Delta representations are structurally diverse and yield higher-contrast attention distributions (max weight {\approx}0.6), enabling more selective and effective routing across layers. This principle applies at both per-sublayer and block granularity. Across all tested scales (220M--7.6B), Delta Attention Residuals consistently outperform both standard residuals and Attention Residuals, with 1.7--8.2% validation perplexity gains. Delta Attention Residuals also enables converting pretrained checkpoints into Delta Attention Residuals via standard fine-tuning. Code is available at https://github.com/wdlctc/delta-attention-residuals-code.
Cheng Luo, Zefan Cai, Junjie Hu
Date pendingcs.LG

On the Residual Scaling of Looped Transformers: Stability and Transferability

Looped (weight-tied) Transformers apply a shared residual block NN times (hh+εf(h)h \leftarrow h + \varepsilon\,f(h), same ff at each step), increasing effective depth without adding parameters. Prior depth-scaling analyses prescribe ε=1/ ⁣L\varepsilon = 1/\!\sqrt{L} for depth-LL residual networks. We show that this is insufficient for looped architectures: weight sharing makes residual updates correlated across iterations, requiring the stronger scaling ε=1/N\varepsilon = 1/N. For multi-layer blocks (LL unique layers looped NN times), we derive a factored parameterization ε=λ/(N ⁣L)\varepsilon = \lambda/(N\!\sqrt{L}) that separates the two sources of growth: 1/N1/N controls the within-layer loop correlation, and 1/ ⁣L1/\!\sqrt{L} controls the across-layer variance. A key consequence is that the optimal learning rate depends only on the number of unique layers LL, not on the loop count NN, enabling direct hyperparameter transfer from small to large NN without retuning. Experiments on looped Transformers confirm that 1/N1/N scaling improves trainability and yields better loss than 1/ ⁣N1/\!\sqrt{N} scaling across loop counts.
Shaowen Wang, Bingrui Li, Ge Zhang +3