Skip to content
Preprint

MemoryCPT: An End-to-End Agent Memory Framework for Cost-Performance Trade-off

Aug 2026 · 0 citations · 23 references
Computer Science

TL;DR

Experiments on LoCoMo and LongMemEval show that MemoryCPT improves the cost-performance trade-off over the evaluated baselines, while ablation and sensitivity analyses characterize the contributions of its components and the effects of key design choices.

Abstract

Long-horizon LLM agents require memory systems that recover useful evidence from large interaction histories without passing excessive context to downstream models. Existing memory pipelines often rely on hand-crafted heuristics and repeated LLM calls, which can introduce redundant context and high inference cost. We propose MemoryCPT, an end-to-end trainable agent memory pipeline that spans offline memory construction and online query-conditioned context generation. MemoryCPT consists of two stages: Query-agnostic Distillation (QAD), which distills a modular memory-construction pipeline into a compact model using explicit reasoning traces; and Query-aware Retrieval and Summarization (QAR), which combines reciprocal rank fusion (RRF) with a LoRA-based summarizer trained via Group Relative Policy Optimization (GRPO) under a cost-aware reward. We further introduce Quality per Cost (QPC) to quantify answer quality per unit inference cost. Experiments on LoCoMo and LongMemEval show that MemoryCPT improves the cost-performance trade-off over the evaluated baselines, while ablation and sensitivity analyses characterize the contributions of its components and the effects of key design choices.

View source

Similar papers

Preprint Aug 2026

Stop When Memory Suffices: Evidence-Conditioned Progressive Execution for LLM Agents

This work introduces Router-Mem, an evidence-conditioned progressive execution framework for long-horizon agent memory that is trained with evidence-level supervision and rationale-conditioned representation distillation and achieves strong answer quality while maintaining low online latency.

Yidan Lin, Kai-Xiang Wang, Jiong Lou et al. · 0 citations
Preprint Aug 2026

Weighted Memory Tree: Remembering What Matters for Long-Horizon LLM Agents

The results suggest that effective long-horizon agent memory depends less on storing more information than on deciding which information should remain active, and that effective long-horizon agent memory depends less on storing more information than on deciding which information should remain active.

Q. Dao, Purvi Kathalkar, Kenneth Eaton · 0 citations
Preprint Aug 2026

LeanMem: Simple and Efficient Long-Term Memory for LLM Agents

LeanMem is proposed, a lightweight long-term memory framework that improves accuracy over the strongest memory-based baseline in every setting, at the lowest or near-lowest construction cost, inference tokens, and latency.

Yuxin Liao, Le Wu, Min Hou et al. · 0 citations
Jul 2026

PRO-LONG: Programmatic Memory Enables Long-Horizon Reasoning

Pro-LONG, a minimal context management framework built around programmatic memory for LLM agents in long-horizon, exploratory settings, is proposed, which addresses the tradeoff of preserving more information makes retrieving relevant details less tractable.

A. Fox, Jun-Lin Wang, P. Rosu et al. · 2 citations · ⚡1
Preprint Aug 2026

MemArbiter: Decision-Time Memory Arbitration for Long-Horizon LLM Agents

Results show that function-aware memory arbitration enables accessible information to guide actions more effectively, and improves post-failure recovery and reduces failed-action repetition and state-action recurrence.

Jiajun Dong, Yutao Hu, Fengrui Fan et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.