arXiv (All)
open access
Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Models
Recurrent LLM architectures have emerged as a promising approach for improving reasoning, as they enable multi-step computation in the embedding space without generating intermediate tokens. Models such as Ouro perform reasoning by iteratively updating internal representations while retaining a stan
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
- Escaping Redundant Reasoning: Structure-Aware Search for Inference-Time LLMs#820751
- Beyond Sequence Order: Syntax-Informed Positional Embeddings for Transformers#432586
- Uncovering the Computational Ingredients of Human-Like Representations in LLMs#819251
- Uncovering the Computational Ingredients of Human-Like Representations in LLMs#809259
- Official Review · ICLR 2024#787182
Record · ID 1130188
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