- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
This paper studies few-step plug-and-play reconstruction with consistency-model priors for sparse-view CT and multi-coil MRI. In this setting, the data-consistency (DC) step has no closed form and is solved approximately with k conjugate-gradient (CG) iterations. The authors argue that, for poorly conditioned operators, truncation error in this inner solve limits reconstruction quality. They propose RELAY, which initializes each DC solve from the previous outer step's DC solution.
Critical strengths
Simple and practical. RELAY needs no training, no extra NFEs, and only one additional image-sized vector of memory.
Thorough DC diagnostics. The paper sweeps the CG budget, NFE, noise level and prior source domain, and reports cost in operator applications rather than only NFE.
Real acquired data. The evaluation includes real multi-coil k-space data (M4Raw).
Critical weaknesses
Limited novelty: the method is warm-started CG. The paper states that RELAY "is algebraically equivalent to applying CG directly to Eq. 4 with initialization z0 = zprev” (Sec. 3, citing Saad, 2003). It also notes in Sec. 2 that “numerical linear algebra has long used warm starts.” The residual-correction formulation, the “RELAY mechanism” panel in Fig. 2, and the “CG on the correction system” entry in Table 1 therefore describe an implementation of a standard warm start, not a new solver. Initializing an iterative x-update from the previous outer iterate is common practice in ADMM implementations. Given this, the contribution amounts to a choice of initial guess for the inner solve. That is useful, but in my view it is below the level expected for ICLR. Could the authors clarify what is technically new beyond warm-starting CG from the previous solution?
Figure 2 is hard to follow. Figure 2 is not self-contained: it relies on bunch of notations that is defined only on page. 4–5, and its “RELAY mechanism” panel suggests a new solver rather than an initialization choice.
The cold-start baseline is weak, and standard alternatives are missing. The main comparisons attribute RELAY's gains to cross-step reuse relative to a zero-initialized CG solve. However, Table 6 shows that simply initializing CG at the DC anchor v already recovers most of the gain (e.g., 37.34 vs. 38.02 dB at 60 views). The standard remedies for an ill-conditioned DC system are also not compared: preconditioned CG, or simply a better initial guess within existing methods. Could the authors report PnP-CM with anchor-initialized CG, and with preconditioned CG, at a matched operator budget, as main-table baselines?
Baseline configuration and the size of the improvements. Section 4 states that the learned baselines retain “the published sampling and guidance settings.” Table 14, however, shows DPS, DDS, DiffPIR and GDM all running at 6 NFE, far below their published regimes. Several baselines appear not to function. DPS (15.3 dB) and CM4IR (15.6 dB) on OrganAMNIST barely change between 18 and 90 views, so they effectively ignore the measurements. DiffPIR and CM produce results within 0.02 dB of each other in every CT setting, with the same operator count. Could the authors tune the diffusion baselines at their intended NFE (or justify the 6-NFE setting), explain the near-identical DiffPIR and CM results, and report variability across test slices?
Is the gain really from more accurate DC? The paper argues that RELAY helps by making the truncated DC solve more accurate while “preserving the exact DC solution.” If so, cold start and RELAY should converge to the same reconstruction as k grows. However, in Table 10 the cold start at k = 30 is still 4 dB below RELAY (33.85 vs. 37.93 dB), and RELAY itself degrades slightly from k = 20 to k = 30 (38.02 vs. 37.93 dB). Could the authors extend the k sweep until the cold start saturates If RELAY exceeds it, how do the authors explain the gain?
My major concern is whether proposed novelty is enough for the conference like ICLR. Although I highly appreciated for simple and neat algorithms, proposed algorithm’s underlying design is already well-studied and is hard to say significant findings.
Questions for authors
Please refer to the weaknesses section.