arXiv AI By Jiahe Geng, Jinpeng Wang, Kun Yuan

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

Read the original on arXiv AI →

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."

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

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