- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes six requirements for inference-time self-iteration and introduces a solver combining local inversion, multiplier updates, and least squares. The overall idea is interesting, and the controlled experiments are fairly systematic. However, I do not think the current theory and experiments support the paper’s strong claims.
Critical strengths
Discussing representation quality, noise handling, and inner-loop optimization within one framework is a useful perspective. The controlled experiments also help explain the individual design choices.
Critical weaknesses
-
Calling these “six requirements” is too strong. R1 and R2 describe information limits under specific statistical assumptions, while R3–R6 are largely tied to the proposed solver. For example, the optimal-regularization argument behind R5 assumes a fixed correct branch assignment. This does not establish a general requirement for self-iterating models.
-
The presentation feels rushed and insufficiently polished. Assumptions, theoretical conclusions, and implementation choices are often packed together without clearly explaining their connections. The authors also disclose using AI coding agents to produce the plotting scripts. And the presentation and unresolved gaps leave me feeling that the submission needs substantial further development.
-
Important baselines and compute comparisons are missing. The problem is closely related to phase retrieval, yet the experiments do not directly compare against AMP, Wirtinger flow, or classical HIO/DR methods discussed in the paper. The vision experiments also use eight chains for the proposed method while all baselines are single models. Without matching computational budgets, the source of the improvement remains unclear.
-
There are several gaps between the theory and its practical application. Poor linear-probe performance does not establish that a representation contains no information accessible to nonlinear learners. The noise correction derived for a fixed linear smoother is not shown to remain unbiased after adaptive branch selection. Likewise, difficulties with gradient-based optimization do not establish that derivative-free selection is necessary. Finally, although the experiments cover three domains, they largely share the same specialized multi-branch inverse-problem structure, so the broader applicability remains uncertain.
Questions for authors
See the weaknesses above.