- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CARE-Mem, a memory revision policy trained using decision-level counterfactual credit assignment. The policy outputs node actions, replacement text, and propagation gates. During training, single-node, single-edge, and local joint interventions are executed from the same memory snapshot, and the resulting utility differences are assigned to the corresponding output tokens. At inference, only one proposal is executed, without counterfactual evaluation. The authors introduce CAREBench-240, a human-annotated dataset containing 240 cases, and evaluate transfer performance on MemoryAgentBench FactConsolidation. CARE-Mem outperforms graph-memory baselines mapped to the same interface. Its main improvements over the SFT parent and global-plus-local control are in replacement-text accuracy and downstream question answering.
Critical strengths
-
The paper proposes a concrete, executable credit-assignment scheme to address the limitations of a shared reward for an entire proposal. Modifying node actions or propagation gates from the same snapshot allows the method to assess a decision’s effect on execution and assign the signal to the corresponding output span. Counterfactual controls use deterministic execution and require no additional model generations, while inference incurs no counterfactual overhead. This gives the method clear technical substance and practical value, which is the main reason for supporting acceptance.
-
Matched controls and external evaluation provide evidence of effectiveness. With the same SFT initialization, training cases, and decoder, strict replacement accuracy increases from 39.6% to 48.7%. With the learned adapters frozen, average MemoryAgentBench accuracy increases from 33.0% to 44.0%. CAREBench also uses independent annotation and adjudication and reports high inter-annotator agreement. These results suggest that the gains are not solely attributable to interface adaptation or additional supervision.
Critical weaknesses
-
The existing comparisons do not fully establish that the gains come from more accurate decision-level credit assignment. In Table 3, CARE-Mem’s Action Macro-F1 and Edge F1 are approximately the same as those of the SFT parent, and neither metric differs significantly from the SFT parent or A2. The main improvement is in replacement text. REVISE accounts for only 15.4% of node decisions but receives 50.4% of the absolute node token-credit mass because replacement text makes its spans longer. Moreover, global advantages are standardized, local credits are not, and A2 directly adds the two. The comparisons therefore change the credit source, numerical scale, and relative training weights of different output components simultaneously. The gains may partly reflect differences in optimization scale or greater weighting of replacement text. This limits attribution of the gains to the paper’s core algorithm.
-
The relationship between the utility function and revision correctness is problematic. Executing the human-adjudicated reference proposals yields average Current, Retention, and History scores of only 0.5625, 0.4792, and 0.5000 in Table 22. The authors acknowledge a mismatch between these scores and structural correctness. In Table 21, 75.25% of edge controls change only edit cost, while History remains unchanged across all interventions. Removing the Retention term (A5) produces the highest mean Action Macro-F1 and replacement accuracy, although the Macro-F1 difference is not statistically significant. These findings raise the possibility that local credit primarily reflects edit-cost preferences and scoring rules rather than revision utility. Since counterfactual credit directly depends on this utility function, the issue concerns a central assumption of the method.
Questions for authors
-
Why do correct reference proposals receive probe scores substantially below one? How much of this comes from empty probe families, and how much from scoring or execution mismatches? Do these issues also occur in the 16 cases used for policy training?
-
What results are obtained when local credit is generated from edit cost alone? Given that most edge controls change only cost, could this baseline explain the observed edge credit and downstream gains?
-
After matching advantage scales and ensuring that each decision’s total training weight is independent of its token count, does CARE-Mem still outperform global-only and global-plus-local training? This would directly affect attribution of the gains to credit assignment.
-
Node counterfactual controls bypass reachability, whereas the original proposal follows gating. For an unreachable node, the utility difference therefore changes both the action and whether it is executed. Why should this difference be assigned to the node action rather than the propagation gate?
-
The 800 MemoryAgentBench questions share four fact contexts. Is the average gain of 11 percentage points consistent across these contexts? A2’s Run 0 is comparable to CARE-Mem, while its other two runs perform much worse. Does this mainly reflect training instability or revision errors in particular contexts?