- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes TokenWorth, an online memory management framework for resource-constrained lifelong agents. It combines an online linear scorer with a Recursive Feature Machine (RFM)-based residual learner to estimate query-dependent memory worth from execution feedback. The learned worth is used for both memory retrieval and long-term memory management. Experiments on the DB, OS, and KG environments of LifelongAgentBench show that TokenWorth achieves higher task success rates than various memory baselines while reducing output-token usage.
Critical strengths
- Practically relevant problem. The paper investigates how lifelong agents can effectively reuse past experiences under limited generation, interaction, and memory resources, addressing practical constraints in real-world deployment.
- Clear overall framework. TokenWorth applies learned memory worth to both retrieval and long-term memory management, with continuous updates from execution feedback, forming a coherent online memory learning framework.
- Strong main experimental results. The paper compares TokenWorth against multiple memory baselines across three LifelongAgentBench environments and two backbone models. TokenWorth achieves the highest task success rate in all six main settings while reducing output-token usage, with particularly substantial gains on DB.
Critical weaknesses
Weakness 1: Insufficient evidence for resource robustness
The paper emphasizes joint constraints on generation, interaction, and memory resources, but the experiments do not adequately validate its central claim of resource robustness.
- Generation Budget: Although the paper reports reduced output-token usage, it does not evaluate task success under different generation budgets.
- Interaction Budget: The experiments impose fixed limits on interaction rounds but do not report actual interaction counts or evaluate performance under different interaction budgets.
- Memory Budget: All three main environments set (K_{\max}=1), reducing memory selection to choosing a single high-value memory. The method neither considers combining multiple memories nor explicitly accounts for memory token costs. Moreover, the injection-length constraint may be inactive when memories are sufficiently short. Without reporting actual injected memory tokens or evaluating different memory budgets, it is unclear whether this constraint meaningfully affects the experiments.
Overall, the results demonstrate improved task success under specific fixed budgets, but provide insufficient evidence for the broader claim of resource robustness.
Weakness 2: Limited generalization
In Appendix C, TokenWorth achieves only marginal improvements over the strongest baselines on BigCodeBench and ALFWorld (0.2 and 0.3 percentage points, respectively, with the local model). It even underperforms RAG on API-based BigCodeBench. These results contrast sharply with the substantial gains on DB, suggesting that the method's effectiveness may be task-dependent. The paper does not adequately investigate this discrepancy.
Weakness 3: Limited gains from the complex design
In Figure 3(b), the simple linear scorer already achieves 64.2% success. Adding RFM reduces performance to 63.0%, while the full method reaches only 65.0%—a gain of just 0.8 percentage points over the linear baseline. This raises questions about whether the added RFM and AGOP complexity is justified. Furthermore, component ablations are not provided for the other environments, leaving their broader necessity unclear.
Questions for authors
See weaknesses.