- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes an escape and retrieval field (ERF). This is a memory model that attracts queries near stored examples and pushes them away elsewhere. This approach allows for geometric results on retention, escape, and capacity. The image experiments use a fitted static rule, with a learned representation and a separate radius for each memory
Critical strengths
- The rejection mechanism is a real strength. Its geometry makes it clear where a query is supported. The local guarantees give this interpretation a mathematical basis.
- Comparisons of individual versus global radii help show what the fitted rule contributes. The supplementary code also makes several implementation choices clear.
Critical weaknesses
- The experiments leave a question about what ERF adds. They use static acceptance and identification matches the comparator for the fixed representation. A static method is useful, but the paper needs to clarify its added value
- There are some gaps in theory and experimental record. For Proposition 1, gives two stationary points, and . This looks fixable. However the package lacks the promised notebooks, main run records, and preregistration documents and does not fully control minibatch randomness. These issues make it difficult to verify important claims
Questions for authors
- For the fixed representation, which result best shows what the method adds? Which guarantees still hold when fitted supports overlap?
- How would you correct the assumptions of Proposition 1? Does this change any later result?
- Could you provide the promised files and explain how minibatch sampling was seeded? From the existing main runs, could you also report accuracy among accepted queries, coverage, and false acceptance of unknown queries?