analiza aiqbench
This research investigates "Competing Learning" in hybrid language models where linear-time recurrence layers outpace softmax attention in retrieving contextual information, effectively suppressing the latter's learning signals. The authors propose a staged training procedure that pauses recurrence updates to allow attention mechanisms to specialize in retrieval tasks, resulting in significant improvements across reasoning and context-length benchmarks. This work offers critical insights into optimizing the co-design of mixed architectural components for next-generation foundation models.
Competing Learning in Hybrid Architectures
arXiv:2610.26830v1 Announce Type: new Abstract: Many modern language models have adopted hybrid architectures that incorporate both linear-time recurrence and softmax attention. 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. 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. Stopping weight updates in recurrence in the middle of training helps attention learn retrieval. Based on these results, we propose a staged training procedure for pre-training hybrid architectures on natural language. Empirical results on models up to 1B parameters show that our method results in substantial improvement in language modeling loss, common-sense reasoning, as well as a wide range of retrieval-related tasks across different context lengths.
Abstract:Many modern language models have adopted hybrid architectures that incorporate both linear-time recurrence and softmax attention. 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. 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. Stopping weight updates in recurrence in the middle of training helps attention learn retrieval. Based on these results, we propose a staged training procedure for pre-training hybrid architectures on natural language. Empirical results on models up to 1B parameters show that our method results in substantial improvement in language modeling loss, common-sense reasoning, as well as a wide range of retrieval-related tasks across different context lengths.
Computation and Language (cs.CL)
arXiv:2610.26830 [cs.CL]
(or arXiv:2610.26830v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2610.26830 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 268 cuvinte
Subiecte conexe
The AI Legal Specialist: A Juridically Autonomous Professional Profile for AI Governance
arXiv · 12 iun. 2026

[AINews] Google admits AI Mode hurts Search revenue; -15% $500B drop worst since 2004 IPO. AI Bear Market coming?
Latent Space · 31 oct. 2026
Terminal Agents: A Survey of AI Agents in Command-Line Environments
arXiv · 24 aug. 2026

Data Mesh vs. Data Fabric: Key Differences and How the Lakehouse Resolves the Debate
Databricks · 25 aug. 2026