- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2(+1)
- Soundness
- 2
Read review
Paper summary
This paper investigates whether deterministic n-gram memory addresses provide a reliable deletion boundary after language-model fine-tuning. On memory-augmented Pythia and Qwen models, this authors study synthetic trigger–continuation mappings through freezing, row deletion, and component-intervention experiments. They find that ordinary fine-tuning can encode these mappings in the backbone, while explicitly row-constrained writes can be removed by deleting the corresponding rows. Moreover, higher table learning rates can increase memory dependence, but incur quality costs and do not guarantee row-level locality.
Critical strengths
S1. The paper conducts an extensive set of experiments to investigate the storage and deletion of learned mappings.
S2. It shows that deterministic read addresses do not guarantee that information learned through ordinary fine-tuning remains confined to the corresponding table rows.
Critical weaknesses
W1. Limited novelty of the central finding. When parameters remain trainable, the backbone’s ability to learn new mappings is an expected consequence of joint optimization. The authors acknowledge that prior work does not claim that ordinary fine-tuning preserves row-level locality. It therefore remains unclear what substantive new insight the paper offers beyond empirically confirming that deterministic read addresses alone do not guarantee localized writes.
W2. Lack of a unified explanation and a coherent argument. The experiments appear loosely organized and lack a clear logical progression. While component swaps and learning-rate sweeps provide useful observations, these are not synthesized into a coherent explanation of storage locality or generalizable design principles. The paper therefore reads likely as a collection of experiments on specific implementations, with an unclear broader contribution.
Questions for authors
Q1. What substantive new insight does the paper offer beyond the expected observation that a trainable backbone can learn new mappings without updating the memory table?
Q2. What conditions determine whether learned information resides in the backbone or becomes localized to specific memory rows, and how do the component-swap and learning-rate experiments jointly support this explanation?
Halfway through the discussion period
Dear reviewers,
Thank you for your continued participation in the review process. The authors have responded to the reviews. When you get a chance, please acknowledge their response and, where appropriate, please respond to their comments.
Thanks, AC