arXiv (All)
open access
Learning to Extrapolate in Depth with Looped Transformers
Looped transformers reuse a single block across iterations, raising a natural question: how far can a block trained at one depth be safely extrapolated to greater depths? We study this question for all-pairs graph connectivity, where harder graphs require longer-range information propagation. We sho
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
- Tight Sample Complexity of Transformers#267650
- X-MoD: Practical Scaling Laws for Sparse-Depth Routing Beyond Mixture-of-Depths#1119285
- Looping Beyond Twice: A Scalable Recipe for Looped Mixture-of-Experts#1156088
- Improved Bounds for Cross-Sperner Systems#628828
- Tight Energy Lower Bounds for Distributed Graph Algorithms#467099
Record · ID 1325352
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