arXiv AI By Yumin Choi, Sangwoo Park, Minki Kang, Jinheon Baek, Sung Ju Hwang

PREPING: Zero-Task Agent Memory Construction via Self-Practice

Read the original on arXiv AI →

PREPING introduces a proposer-guided framework for constructing agent memory before encountering target tasks, using self-generated synthetic practice. The method employs a proposer memory to shape synthetic tasks, a solver to execute them, and a validator to filter useful trajectories, thereby avoiding redundancy and infeasibility. Experiments on AppWorld, BFCL v3, and MCP-Universe demonstrate that PREPING outperforms a no-memory baseline and rivals playbook-based approaches while reducing deployment costs by 2.99× and 2.23× respectively.

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 AI
Oct 7

MemCo: Memory-Centric Collaboration for Generalizing LLM Agents to Unseen Environments

MemCo introduces a memory‑centric collaboration framework that equips large language model agents with both local and global memory spaces. Local memory preserves environment‑specific details, while global memory captures transferable workflows from local trajectories. During online interaction, MemCo selectively routes relevant memories based on the agent’s state and decision phase, enabling reuse of other agents’ experiences without over‑generalizing environment‑specific information.

By Xinting Liao, Siyan Liu, Rabab K. Ward, Holger R. Roth, Xiaoxiao Li
arXiv Computation and Language
Sep 21

MemoryArena: Benchmarking Agent Memory in Interdependent Multi-Session Agentic Tasks

MemoryArena is a new evaluation gym that benchmarks agent memory in interdependent multi‑session tasks. Unlike prior benchmarks that test memorization or single‑session action in isolation, MemoryArena requires agents to acquire memory while interacting with the environment and then use that memory to guide future decisions across a range of tasks such as web navigation, planning, information search, and formal reasoning. The benchmark reveals that agents excelling on existing long‑context memory tests perform poorly here, highlighting a gap in current memory evaluation methods.

By Zexue He, Yu Wang, Churan Zhi, Yuanzhe Hu, Tzu-Ping Chen, Lang Yin, Ze Chen, Tong Arthur Wu, Siru Ouyang, Zihan Wang, Jiaxin Pei, Julian McAuley, Yejin Choi, Alex Pentland
arXiv AI
Oct 7

DAEDALUS: Bootstrapping Agent Memory from Self-Generated Tasks

DAEDALUS is a method that builds reusable memory for large‑language‑model agents by having an explorer agent generate self‑created tasks and a solver agent attempt them. When the solver fails, a heuristic is extracted and only accepted after repeated successful use, then added to a memory bank for future test‑time use. Experiments on AppWorld, τ²‑bench, and AutomationBench show that DAEDALUS raises mean success rates by up to 15.9 points and pass⁵ by up to 2.2× compared to a no‑memory baseline, while also providing a cost‑effective alternative to training‑task or oracle‑verifier approaches.

By Antoine Edy, Max Conti, Victor Xing, Marc-Antoine Allard, Nawfal Benhamdane, Gautier Viaud
arXiv AI
Aug 25

CONTRAMEM: Learning Self-Evolving Procedural Memory from Contrasting Multi-Model Trajectories

arXiv:2608.22533v1 Announce Type: new Abstract: Autonomous computer-use agents are increasingly applied to long-horizon tasks requiring coordinated application calls, persistent state tracking, and v...

By Zheyuan Deng, Binghang Lu, Hanqi Feng, Shirley Huang, Dianzhuo Wang, Yuanda Xu, Zhiwei Zhang, Yige Sun, Changhong Mou, Runyu Zhang, Yuexing Hao, Barnabas Poczos, Xiaomin Li