Competing Learning in Hybrid Architectures
Modern recurrence layers provide a highly expressive mixing mechanism while ensuring high throughput by compressing contextual information into a fixed-size state, but underperform softmax attention in contextual information retrieval.
ProofPaper ↗
Key points
- Many modern language models have adopted hybrid architectures that incorporate both linear-time recurrence and softmax attention.
- In this paper, we reveal a Competing Learning phenomenon where different kinds of mixers compete to learn the same function, and when any layer learns a function, it suppresses the corresponding learning signal for other layers.
- Layer attribution analysis reveals that under typical data distributions, modern recurrence learns retrieval functions faster than softmax attention, causing attention to fail to learn retrieval in most cases.
- Based on these results, we propose a staged training procedure for pre-training hybrid architectures on natural language.
Sources (2)
- [1]Competing Learning in Hybrid ArchitecturesHugging Face Daily Papers · Oct 19, 12:00 AM
Modern recurrence layers provide a highly expressive mixing mechanism while ensuring high throughput by compressing contextual information into a fixed-size state, but underperform softmax attention in contextual information retrieval.
Many modern language models have adopted hybrid architectures that incorporate both linear-time recurrence and softmax attention.
- [2]Competing Learning in Hybrid ArchitecturesarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 19, 05:55 PM · same content
Extractive summary: sentences quoted from the sources.
Before this
- Oct 18, 2026SurGPT: A Multi-Task Foundation Model for Robotic Surgical Skills Assessment and Gesture Recognition
- Oct 16, 2026Distillation, Self-Training, and the Fragility of Learned Chemical Reasoning
- Oct 16, 2026[Research] 2,788 tokens/s on a single RTX 5090 with a diffusion LLM — Introducing ORL (fully open source)
- Oct 16, 2026Sample, Mix, or Verify? Allocating Test-Time Compute under Imperfect Verifiers
- Oct 16, 2026ReLaDrift: Recurrent Language Generation via Drifting for Test-Time Scaling
- Oct 16, 2026COMET: Decoupled Distillation, Routing, and Capacity Control for Task-Agnostic Continual Vision--Language Learning