- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
I am new to the field of weight-tied networks and therefore cannot provide a sufficiently reliable assessment of the paper's technical aspects.
Critical strengths
N/A
Critical weaknesses
The organization and presentation require substantial improvement to enhance readability. In particular, the paper should clearly introduce the problem setting and notation without assuming prior familiarity with the setup. Moreover, despite having ample space available, the manuscript devotes only a few lines to related work.
Questions for authors
N/A
2 comments
Thank you for your responses. I believe the manuscript requires substantial revision to meet ICLR's presentation standards. I therefore maintain my original scores.
The organization and presentation require substantial improvement to enhance readability. In particular, the paper should clearly introduce the problem setting and notation without assuming prior familiarity with the setup. Moreover, despite having ample space available, the manuscript devotes only a few lines to related work.
We agree that the opening asks readers to interpret several residuals before giving them a reason to distinguish them. We will start §1 with one input, one update and one prediction. A weight-tied refiner applies the same learned function at every step. Let Ht denote the hidden features after step t and pt the class probabilities obtained from them. If the next step multiplies every feature by 1.34, the relative state change is 0.34, but its direction is identical. A normalized head can give identical probabilities. In our 3D model the logits still move while saturated probabilities and labels can stay fixed. This example explains why we measure state motion, probability change and task performance separately.
We will introduce the unit of analysis (a point or token) before the projection formulas in §2.1. A short key next to the first example will define the relative residual, norm ratio, normalized-state change and output divergence in words. Figure 1 will follow that example. Its caption will identify which curves measure state, predictions and task performance, and identify the training depth. Readers can then consult Appendix D for the proof and Appendix C for numerical resolution.
We will expand §1’s related-work paragraph around three questions a newcomer can ask. What does a fixed-point solver certify (DEQ and monDEQ)? What evidence permits an early exit (CALM’s saturation signal and Huginn’s output KL)? How is the stopping decision learned in ACT and PonderNet? These comparisons explain what each method monitors and why we report both executed updates and measured latency.