atlas

Research map / Multi-agent systems and games / LLM agents

Learning Query-Aware Budget-Tier Routing for Runtime Agent Memory

ICML 2026 · Multi-agent systems and games › LLM agents · approach: Agentic benchmarks and orchestration · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes BudgetMem, a runtime agent memory framework where each memory module has Low/Mid/High budget tiers and a PPO-trained lightweight router selects tiers per module to trade off F1/Judge performance against token cost on LoCoMo, LongMemEval, and HotpotQA.

Problem

Runtime agent memory extraction is costly and offers little explicit control over the performance-cost trade-off, while offline query-agnostic memory construction can discard query-critical information.

Approach

Expose each memory-pipeline module at three budget tiers (implementation, reasoning, or capacity tiering) and learn a shared query-aware router with RL that picks a tier per module under a cost-aware reward with variance-based reward-scale alignment.

Key results

Surprising findings

Limitations

Experimental setup

Datasets: LoCoMo LongMemEval HotpotQA

Benchmarks: LoCoMo LongMemEval HotpotQA

Metrics: F1 LLM-as-a-judge accuracy monetary cost (token-based) latency

Baselines: ReadAgent MemoryBank A-MEM LangMem Mem0 MemoryOS LightMem

Builds on: PPO LightMem Contriever

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy