arXiv Machine Learning By Nis Meinert, Jakob Gawlikowski, Edward Grant, Max Cyprys, Nathan Schurr, Neil Boston, Alfredo Ibias, Milind Tambe, Janusz Marecki

Continual Reinforcement Learning Is an Integration Problem

Read the original on arXiv Machine Learning →

The paper proposes ten desiderata for designing and evaluating reinforcement‑learning agents that learn continuously over a lifetime. It reviews existing approaches against these criteria, noting that no single agent has yet integrated all ten. Additionally, it introduces a compact persistent‑world scenario and a benchmark to test multiple behavioral capabilities within one continuous lifetime.

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 Machine Learning.

arXiv Computation and Language
Oct 22

Memory-Centric Continual Learning for AI Agents

Memory-Centric Continual Learning for AI Agents proposes a framework that redefines agent memory as a driver of future actions rather than a passive retrieval cache. It introduces a three-axis taxonomy—substrates, assets, and policies—to structure memory, a two-loop lifecycle for updating memory state and refining management policies, and an evaluation protocol that isolates genuine behavioral gains from simple context expansion. The paper also presents a memory scaling framework to model how performance scales with experience, storage, and compute across non-parametric and parametric memory.

By Dongfang Li, Zhuoen Chen, Bonian Jia, Zixuan Liu, Zhengxuan Lu, Can Deng, Yukun Shi, Yuhang Meng, Xin Zhang, Jiahe Huang, Fuhao Li, Junmai Wang, Shunyao Wen, Jingjun Sun, Jiaxu Tian, Jiangling Zhang, Zihan Wang, Liangyou Li, Yitong Yao, Shuangyong Song, Beilun Wang, Pengxu Wei, Hanlin Xu, Chang Liu, Yongxiang Li, Baotian Hu, Xiangyang Ji, Min Zhang
arXiv Machine Learning
Oct 9

From a Prompt to Repertoires: Evolving Functional REpertoires Enable LLM Continual Learning

The paper introduces Evolving Functional REpertoires (EFRE), a method that replaces a single prompt with a dynamic set of functions to enable large language models to learn new tasks sequentially without forgetting. EFRE refines existing functions when updates are compatible and creates new ones when updates conflict, thereby mitigating catastrophic forgetting and overfitting. Experiments on a three‑task continual‑learning stream show EFRE outperforms GRPO by 7.50 percentage points and reduces performance drop on a subsequent task by only 1.56 percentage points compared to base prompt optimization.

By Fengyuan Liu, Yue Wang, Hangxi Guo, Fengyuan Liu, Chenxu Wu, Yanguang Liu, Mengnan Du