arXiv (All)
open access
Structured Sparse Memory for Recurrent Reasoning
Recurrent models trained from scratch have recently become competitive on ARC-style reasoning tasks, but the usual framing around small recurrent backbones overlooks two important parts of the system: task-conditioned memory and synthetic augmentation data. We study this regime through CHARM, a comp
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
- Shared Memory Versus Message Passing for Iterative Solution of Sparse, Irregular Problems#472212
- Scaling Relationship on Learning Mathematical Reasoning with Large Language Models#328708
- Bilevel Planning with Learned Symbolic Abstractions from Interaction Data#986830
- Effects of Ultra-short Offline States on Item-level Verbal Memory#305998
- Skill-Conditioned Gated Self-Distillation for LLM Reasoning#926054
Record · ID 1117982
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