arXiv (All)
open access
Enabling Dynamic Computation in Looped LMs
Looped LMs are parameter efficient and promise dynamic computation (saving memory and FLOPs on easy tokens). However, state-of-the-art open Looped LMs trained with this dynamic computation capability (Ouro models) do not realize it in practice as each loop iteration (depth) requires its own level of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- BEAM: Bi-level Memory-adaptive Algorithmic Evolution for LLM-Powered Heuristic Design#13131
- AI Hardware Accelerators for Large Language Models: Architectures and the Memory Wall#784815
- AI Hardware Accelerators for Large Language Models: Architectures and the Memory Wall#783225
- Looping Beyond Twice: A Scalable Recipe for Looped Mixture-of-Experts#1156088
- TACO: Ternary Absolute-max Column-wise One-sparse Optimizer for LLM Fine-Tuning#1161013
Record · ID 1233052
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive