- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper proposes a way to improve a diffusion model’s prediction using a few real measurements, learning how errors at different locations are related so that each measurement can correct a wider area. It uses those relationships to choose where to measure next, improving radio-map reconstruction and depth estimation in its experiments.
Critical strengths
- GPARA introduces a potentially novel use of learned graph-based error correlations to connect diffusion refinement with active measurement selection.
- In experiments, the paper shows that using the same graph for both measurement selection and refinement helps both tasks than controlled baselines.
Critical weaknesses
- The benefit of learning the graph is not strongly established. In Table 4(a), learned edge weights improve RMSE over a uniform graph by only about 2% on both tasks, despite requiring an additional trained network. Moreover, the paper does not compare uniform and learned graphs in the full active-acquisition pipeline, so it's unclear whether graph learning provides sufficient benefit to justify its added complexity.
Questions for authors
How does the paper's algorithm work with other diffusion priors such as image generation for inverse tasks such as inpainting?
3 comments
Thanks for the additional experiments and responses to my questions. I will keep my score given that the gain of a learned graph versus non-learned seems very modest and requires additional training.
Thank you for your consideration. We agree that graph learning provides incremental rather than dominant gains. We would like to clarify that learning graph conductances is an optional instantiation rather than a prerequisite for GPARA. The same graph-residual posterior-response framework accommodates learned, fixed or other graph constructions, allowing the choice to be tailored to the target task. Accordingly, a uniform graph can still be a viable alternative without additional training, while learned conductances provide further improvements when beneficial.
Response (W1): Thanks for your comment. We have added a uniform-graph variant of the complete active-acquisition pipeline in revised Table 5(b). The uniform variant achieves RMSEs of 0.0146 on RFR and 0.243 on DC, compared with 0.0142 and 0.236 for learned graph, corresponding to reductions of 2.7% and 2.9%. Thus, the additional gains persist, while remain modest.
Regarding the additional complexity, we also compared computational overhead of the learned conductances in Table 8. The graph predictors are lightweight, with only 0.769M and 0.433M parameters for RFR and DC, respectively. They are trained offline once per task with the diffusion prior frozen and reused across deployment instances. Graph learning introduces negligible deployment overhead: acquisition time increases only 0.08 s on DC, while peak memory remains virtually unchanged. RFR shows no increase in either acquisition time or memory. Reconstruction time increases by only 0.01 s for both tasks.
Thus, our results distinguish the contributions of the framework: substantial gains arise from structured posterior propagation and repeated refinement, while graph conductance learning provides additional adaptation to the target task, offering further reconstruction improvements at marginal additional deployment cost.
Table 8: Online computational overhead of learned graph conductances relative to uniform graphs.
Response (Q1): Thank you for your question. GPARA is designed as a general framework for grounding pretrained diffusion priors with sparse measurements. Many conditional diffusion models incorporate prior information through semantic embeddings (e.g., CLIP features), visual features, or other contextual representations. GPARA leverages such information to learn a structured graph over prediction residuals, capturing dependencies that guide how measurement innovations propagate across the target. The resulting graph-posterior response supports both active acquisition and observation-consistent refinement during diffusion sampling.
For example, in image inpainting, the known pixels serve as observations. We need to learn a graph network offline through posterior refinement under the diffusion backbone as shown in Appendx C.1-C.2. At each reverse step t, GPARA obtains the predicted clean image with the fixed diffusion backbone, computes the graph-posterior residual correction, and injects the corrected estimate into the reverse diffusion transition, following the refinement mechanism in Eq. (9)-(13). Here, only Stage II in Algorithm 1 is needed because the observed locations are predefined.
Thus, the framework is transferable at the methodological level, although different priors and observation models may require task-specific adaptation.