CLMay 21

What Training Data Teaches RL Memory Agents: An Empirical Study of Curriculum Effects in Memory-Augmented QA

arXiv:2605.2306782.4
Predicted impact top 62% in CL · last 90 daysOriginality Incremental advance
AI Analysis

For researchers training RL-based memory agents, this work reveals that curriculum composition controls skill specialization beyond aggregate metrics, challenging single-benchmark evaluation practices.

This paper studies how training data composition affects RL-trained memory agents for multi-session QA, finding that curriculum composition acts as a fine-grained lever on specialization rather than a uniform scaling factor. The mixed curriculum (LoCoMo + LongMemEval) achieves the strongest overall F1 on both benchmarks, while out-of-domain training transfers temporal reasoning despite weak aggregate performance.

Reinforcement learning (RL) has emerged as a viable recipe for training LLM agents to reason over external memory banks in multi-session dialogue. Existing work trains exclusively on a single benchmark, leaving open how the composition of training data shapes the skills a memory agent acquires. We present a controlled empirical study that holds architecture, RL algorithm, and all hyperparameters fixed and varies only the training curriculum across three conditions: in-domain (LoCoMo), mixed-benchmark (LoCoMo + LongMemEval), and out-of-domain (LongMemEval only). Across two benchmarks and ten question types, curriculum composition acts as a fine-grained lever on specialization rather than a uniform scaling factor on performance. The mixed curriculum yields the strongest overall F1 on both evaluation sets. Training on a narrow out-of-domain set transfers a targeted skill - temporal reasoning - despite weak aggregate performance. Per-type differences substantially exceed aggregate differences, indicating that single-number benchmark comparisons systematically underreport curriculum effects. We further report two practical lessons from adapting GRPO to a single-GPU regime: cross-benchmark mixing requires filtering format-specific noise from memory banks to preserve training signal, and binary exact-match reward produces no learning signal at the small group sizes (G = 4) required on one GPU, motivating continuous reward functions in this regime.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes