AIarXiv

Ranked by formulaVerdict: Routine

Multi-Stream Attention Residuals

Attention Residuals (AttnRes) enables content-dependent retrieval over network depth, which can be viewed as single-stream softmax attention along the depth axis.

By Qin, Zhang, Dai +7

Score█████░░░░░4.7

Key numbers

  • 1.58x over the standard residual
  • 1.35x for AttnRes and 1.30

Caveats

  • Preprint; not yet peer reviewed.

VerdictCompetent work. Briefs at most.

Read the originalPDFCode

Abstract

Attention Residuals (AttnRes) enables content-dependent retrieval over network depth, which can be viewed as single-stream softmax attention along the depth axis. Inspired by the success of multi-head attention along the sequence axis, we introduce Multi-Stream Attention Residuals (MSAR), an extension of AttnRes that generalizes this mechanism to multi-head depth attention, yielding substantial performance gains with minimal additional overhead. MSAR draws stream diversity from sequence context through multi-scale causal convolutions, allowing different heads to retrieve historical representations through distinct contextual views while preserving the integrity of the hidden representation. The retrieved streams are combined through lightweight adaptive mixing to generate the single-stream layer input. By retaining single-stream sources and expanding them on demand, MSAR supports multi-stream computation without requiring persistent multi-stream storage or communication. Across all 12 downstream benchmarks at the 18B and 28B MoE scales, MSAR consistently outperforms prior residual variants, including standard residual connections, manifold-constrained Hyper-Connections (mHC), and AttnRes. Scaling-law experiments yield an iso-loss compute speedup of 1.58× over the standard residual baseline, compared with 1.35× for AttnRes and 1.30× for mHC. These results make MSAR a promising residual architecture for large-scale pre-training.

Xiaohan Qin, Xiangdong Zhang, Tuo Dai, Sunan Zou, Huaijin Wu, Yebin Yang, Zhuo Xia, Lin Yao, Yuliang Liu, Junchi Yan

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude███░░ 318%Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
Evidence██░░░ 214%Limited: single setting, weak baselines, or an observational association presented as causal.
Novelty██░░░ 216%A new combination of known ideas.
Trajectory███░░ 318%A clear path to scale.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose); breadth (many tasks); gains (x-fold, outperforms); novelty (alternative to status quo); verification (multiple benchmarks); scale (scalable, efficient). Red flags: derivative (modified version).

How the score was computed

rank-2026-10-07

Score█████░░░░░4.7

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Merit
4.3 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.1 / 10
Shrunk toward the desk prior by editor confidence (46%).
Attention
68%
Citations, upvotes, points, mentions.
Freshness
33%
Half-life decay since publication.
  • Citations0 (reference 15, via semantic-scholar, Oct 12, 2026, 13:49 UTC)
  • Influential citations0 (reference 3, via semantic-scholar, Oct 12, 2026, 13:49 UTC)
  • Hugging Face upvotes33 (reference 25, via hf-daily, Oct 13, 2026, 13:49 UTC)
  • GitHub stars26 (reference 250, via hf-daily, Oct 13, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v6 on Oct 12, 2026, 13:49 UTC. Paper type: method.
  • Categories: cs.CL, cs.CV
  • BRIEF, No.5 in the Artificial Intelligence edition of October 13, 2026.