AIDB Daily Papers
MemQ:プロビナンスDAG上でQ学習を自己進化型メモリに統合
※ 日本語タイトル・ポイントはAIによる自動生成です。正確な内容は原論文をご確認ください。
ポイント
- 過去の経験を独立に扱っていたLLMエージェントのメモリ管理に、Q学習とTD(λ)適格性トレースを導入しました。
- メモリ間の依存関係をプロビナンスDAGで記録し、過去の記憶の質を構造的な近接性で評価する新しい手法です。
- 6つのベンチマーク全てで最高成功率を達成し、特に多段階タスクで顕著な性能向上を示しました。
Abstract
Episodic memory allows LLM agents to accumulate and retrieve experience, but current methods treat each memory independently, i.e., evaluating retrieval quality in isolation without accounting for the dependency chains through which memories enable the creation of future memories. We introduce MemQ, which applies TD($λ$) eligibility traces to memory Q-values, propagating credit backward through a provenance DAG that records which memories were retrieved when each new memory was created. Credit weight decays as $(γλ)^d$ with DAG depth $d$, replacing temporal distance with structural proximity. We formalize the setting as an Exogenous-Context MDP, whose factored transition decouples the exogenous task stream from the endogenous memory store. Across six benchmarks, spanning OS interaction, function calling, code generation, multimodal reasoning, embodied reasoning, and expert-level QA, MemQ achieves the highest success rate on all six in generalization evaluation and runtime learning, with gains largest on multi-step tasks that produce deep and relevant provenance chains (up to +5.7~pp) and smallest on single-step classification (+0.77~pp) where single-step updates already suffice. We further study how $γ$ and $λ$ interact with the EC-MDP structure, providing principled guidance for parameter selection and future research. Code is available at https://github.com/jwliao-ai/MemQ.
Paper AI Chat
この論文のPDF全文を対象にAIに質問できます。
質問の例: