- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper introduces inverse-bound recurrent updates to support reversible state changes. It combines algebraic constructions and floating-point error analysis with synthetic undo tasks, depth generalization experiments, and a small language-modeling evaluation.
Critical strengths
- The distinction between correct task outputs and accurate operator restoration is useful. Matched bound/unbound comparisons reveal differences that task accuracy alone would miss.
Critical weaknesses
-
Limited novelty. Explicitly tying operations to their inverses is a direct structural constraint; the paper does not clearly establish the advance beyond existing structured recurrent models.
-
The experimental evidence is not sufficiently solid. Gains are concentrated on synthetic tasks tailored to the construction. The unbound baseline matches task accuracy with more training, while language modeling degrades, leaving the practical benefit of precise state restoration unproven.
Questions for authors
- Does accurate operator restoration improve performance on unseen readouts or subsequent operations when the unbound baseline already achieves correct task outputs?
- Can the authors reconcile the numerical-saturation explanation with the difference between a rounded squared sum and the exact squared sum of stored floating-point values?
- Is the estimated training requirement a fitted extrapolation rather than a lower bound, and how sensitive is it to the fitting interval?
- Do the guarantees extend beyond the vocabulary-bound layer to contextualized updates in a multilayer model?
Thank you for the clarifications. They address some of my concerns, although the presentation still has substantial room for improvement. I have raised my rating to 2.