arXiv (All)
open access
SharedKV-BT: Node-Local Typed Decisions for Behavior-Tree Agents
Agent tasks require sequences of interdependent decisions. Autoregressive models support more flexible decision interfaces than conventional classifiers but incur the latency of token-by-token generation. Recent shared-prefix methods reduce this cost by reusing encoded context and scoring multiple d
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
- CodeSkill: Latent Skill Abstraction for Long-Horizon Code Agents#1117955
- Beyond Reward Engineering: A Data Recipe for Long-Context Reinforcement Learning#1342535
- NCP-ArchPreview Technical Report: Moving towards Latent Space Language Models through Next Concept Prediction#997707
- LLMs Can Never Be Ideally Rational#112524
- Official Review · ICLR 2025#787057
Record · ID 1216702
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