arXiv AI

Compact-Memory LLM Agents via Online Max-Member Clustering and Atom-Aware Packing

The paper introduces RSM‑full, an online clustered‑memory pipeline that uses a cosine‑gated max‑member merge rule and an atom‑aware grouped context packer to improve compact‑memory performance for large language model deployments. On the AMA‑Bench benchmark, RSM‑full achieves 83 % of full‑context quality while using only 32 % of the token cost at a 4 k budget, outperforming streaming‑clustered baselines by 3.5–6.0 pp. Similar gains are observed on the RealMem persona‑memory benchmark, where RSM‑full surpasses Budget‑RAG, matches BM25‑RAG, and outperforms Streaming‑Proto and A‑MEM. whyItMatters":"RSM‑full demonstrates that careful design of memory merging and context packing can substantially reduce token costs while maintaining high quality, addressing practical constraints of latency, cost, and context limits in long‑horizon LLM deployments."

arXiv Machine Learning
Sep 23

CliffCompaction: Cost-Efficient Compaction for Long-Horizon Coding Agents

CliffCompaction is an autocompaction technique that reduces cost by up to 50% while maintaining or improving performance on benchmarks such as Terminal‑Bench and KernelBench. It achieves this by truncating or dropping content without rephrasing, ensuring compacted information remains faithful and preventing context drift. The method enables efficient test‑time scaling, matching or surpassing higher‑cost models like Opus 4.7 and GPT‑5.3 Codex, and delivers significant CUDA kernel speedups on KernelBench.

By Trang Nguyen, Eulrang Cho, Bingqing Chen, Tim Dettmers
arXiv AI
Aug 24

Nexus: Depth-Adaptive KV-Cache Splicing and Retrieval-Decoupled Tool Routing for Agentic LLMs on Unified Memory

Nexus introduces a depth‑adaptive KV‑cache splicing and retrieval‑decoupled tool routing mechanism for agentic large language models that reduces the time‑to‑first‑token (TTFT) by decoupling tool routing from the expensive schema re‑encoding step. It uses an INT8 semantic lookaside buffer to select tools via retrieval and generates arguments from a compressed textual signature, maintaining about 89% routing accuracy even as the tool registry scales to 250 tools. Additionally, Nexus can splice compiled schema KV blocks into the live context, repairing the seam with a depth‑adaptive suffix redecode when rotary position embedding drift exceeds a threshold, ensuring output fidelity while achieving up to 1.7× TTFT speedup at moderate depth.

By Mustafa Arslan
arXiv AI
Sep 2

APEX-EM: Non-Parametric Online Learning for Autonomous Agents via Structured Procedural-Episodic Experience Replay

APEX-EM is a non‑parametric experience memory that stores full procedural‑episodic traces in a typed Procedural Knowledge Graph and retrieves them via semantic search, structural‑signature matching, and graph traversal. It uses a Plan‑Retrieve‑Generate‑Iterate‑Ingest workflow to produce, quality‑gate, and commit experiences, indexing both successes and failures so the agent learns what to reuse and what to avoid. Evaluations on five benchmarks with a shared GPT‑4o backbone show significant performance gains, such as +7.6 pp on BigCodeBench transfer and +1.4 pp on Lifelong Agent Bench, demonstrating that the memory adds to model capability rather than replacing it.

By Pratyay Banerjee, Masud Moshtaghi, Ankit Chadha