- Rating
- 4(+1)
- Confidence
- 4
- Informativeness
- 3(+1)
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper introduce IMPRINT, it uses a Token Profile Table to perform exact matching weighted by the IDF and session specificity of rare tokens, combined with online merging to compress context. It requires no training, no LLM at indexing time, and no GPU at query time, substantially improving retrieval and QA on LoCoMo/LongMemEval.
Critical strengths
1.Problem framing is accurate: rare tokens serve as retrieval signals for personal memory, the theory explains dilution from dense pooling, and the method is simple and efficient. 2.Experiments are thorough: it significantly leads on retrieval/QA across two benchmarks, with comprehensive ablations, granularity interaction, scaling, and significance testing.
Critical weaknesses
1.The theoretical model is simplified, ignoring semantic structure and anisotropy; recall drops sharply under alias/paraphrase perturbations, making exact matching fragile. 2.Generation gains are limited, and temporal/open-domain questions remain weak; it relies on English tokenization, and privacy deletion is only discussed but not evaluated.
Questions for authors
1.Will you constructively articulate the similarities and differences between IMPRINT and BM25 (b=0)?
given these solid additonal experiments, i will raise my socre to 4