- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies how persistent-memory agents can reuse failure-derived lessons without disrupting behavior that was previously successful. RANGE uses matched successful trajectories to constrain each lesson’s applicability, combining memory admission, scope refinement, and scope-gated retrieval. Experiments report improved task success and reduced regression across several interactive environments.
Critical strengths
-
The paper addresses a meaningful problem: a useful correction can become harmful when generalized beyond its appropriate context. Using successful trajectories as evidence for what should be preserved is well motivated.
-
The evaluation covers multiple environments and considers recovery, transfer, and preservation together. The generally consistent improvements, component ablations, and sensitivity analyses provide encouraging evidence for controlled memory reuse.
Critical weaknesses
-
The boundary judgments are insufficiently transparent. Key decisions—identifying critical actions, estimating interference, and determining unsupported scope—are described mainly through abstract controller scores. The implementation and validation of these judgments, including how applicability conditions are evaluated and narrowing is verified, remain unclear. An action appearing in a successful trajectory is not necessarily indispensable.
-
The specific contribution of boundary learning is not fully isolated. Matched successes influence candidate generation, selection, and scope, while stronger preservation constraints also reduce memory admission. The results therefore leave uncertainty about how much improvement comes from more accurate boundaries versus better candidate generation or more conservative filtering.
-
The abstract could be more informative.
Questions for authors
-
Could the authors provide an end-to-end case study showing the failure, matched success, initial lesson, boundary judgment, refined conditions, and resulting behavior? A case where only the scope changes while the repair content remains fixed would be particularly informative.
-
How frequently does support refinement rescue a candidate that would otherwise be rejected, and how much does this refinement contribute beyond admission filtering alone?
-
What are the controller’s total model-call and token costs? Would the advantage remain against a simpler generation-and-filtering approach with comparable compute and memory admission or activation rates?