- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The authors propose a method for using a score-based prior for posterior sampling in ill-posed problems in medical imaging. They propose a way to learn the posterior score and then solve a global fixed-point problem (rather than a sequential reverse SDE problem) to sample from the posterior. They demonstrate their method on MPI, sparse-view CT, and compressed sensing MRI. They compare to diffusion-based methods, including DiffusionMBIR, DPS, and DDS, and classical iterative methods, including conjugate gradient (CG) and ADMM. They show generally stronger image quality (measured by PSNR and SSIM) and efficiency (measured by NFE) compared to these baselines.
Critical strengths
The idea of a using a global fixed-point method is relatively under-explored for diffusion posterior sampling and seems useful for accelerating sampling through parallelization.
Critical weaknesses
How to train the posterior score estimator is unclear. It appears that the method involves learning the score . Does this mean that paired training data are required? If not, how is the standard score model modified to produce take as additional input and output ? Without understanding exactly how this score model is trained, it’s difficult for me to judge its soundness and whether it offers a substantial advantage over existing plug-and-play approaches.
The baseline comparisons are lacking. At this point, methods such as DAPS [1] and PnP-DM [2] are widely regarded as state-of-the-art. The authors should provide comparisons to these approaches, even if they don’t use a Tweedie-based approximation of the posterior mean.
References:
[1] Bingliang Zhang, Wenda Chu, Julius Berner, Chenlin Meng, Anima Anandkumar, Yang Song. “Improving Diffusion Inverse Problem Solving with Decoupled Noise Annealing.” CVPR 2025.
[2] Zihui Wu, Yu Sun, Yifan Chen, Bingliang Zhang, Yisong Yue, Katherine L. Bouman. “Principled Probabilistic Imaging using Diffusion Models as Plug-and-Play Priors.” NeurIPS 2024.
Questions for authors
None
3 comments
Response to Reviewer qbMb (Part 2/3)
Weakness 2:it’s difficult for me to judge its soundness and whether it offers a substantial advantage over existing plug-and-play approaches.
Response: We are sorry that we did not clearly explain the rationale behind our method and its advantages over existing plug-and-play approaches.
Proposition 2 is derived under a Gaussian approximation to the denoising posterior and a linear measurement model with independent Gaussian noise. Within this model, the measurement-conditioned denoising mean is obtained by solving a linear system involving the weighting operator σ²Σₜ⁻¹. This derivation motivates the structure of our estimator. In our implementation, the denoising estimate and spatial weights are learned jointly with the reconstruction system. Rather than separately estimating Σₜ and specifying σ², we directly learn a spatial weighting map Wₜ that jointly accounts for denoising uncertainty and measurement noise. We interpret Wₜ as effective conditioning weights rather than a calibrated estimate of posterior precision. Its strictly positive entries ensure that AᴴA + diag(Wₜ) is positive definite, making the CG subproblem well-defined.
To better understand the advantages of our method, we conduct an ablation study comparing it with its plug-and-play variants. Specifically, we construct two variants using the covariance estimation strategies of ΠGDM (Song et al., 2023) and Convert (Peng et al., 2024). ΠGDM adopts a heuristic, spatially isotropic posterior variance motivated by a Gaussian assumption on x₀. Convert trains a variance prediction head and analytically converts the learned reverse-transition variances into spatially varying denoising posterior variances. Both variants combine their covariance estimates with a separately specified measurement-noise variance to construct the weighting operator. These comparisons evaluate our jointly trained formulation against plug-and-play alternatives within the same global equilibrium framework.
Table 1: Comparison of plug-and-play configurations and weighting schemes for 32-view CT reconstruction under different NFE budgets (mean ± SD). | Global Equilibrium | Plug and Play | Weighting Scheme | NFEs = 10 | | NFEs = 50 | | NFEs = 100 | | | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | :---: | | | | | PSNR ↑ | SSIM ↑ | PSNR ↑ | SSIM ↑ | PSNR ↑ | SSIM ↑ | | ✗ | ✓ | ΠGDM | 26.9 ± 1.05 | 0.722 ± 0.03 | 30.9 ± 1.42 | 0.816 ± 0.02 | 31.8 ± 1.42 | 0.831 ± 0.01 | | ✓ | ✓ | ΠGDM | 31.7 ± 0.92 | 0.856 ± 0.01 | 34.1 ± 1.15 | 0.886 ± 0.01 | 35.6 ± 0.90 | 0.908 ± 0.01 | | ✗ | ✓ | Convert | 26.6 ± 0.92 | 0.706 ± 0.03 | 30.7 ± 1.34 | 0.821 ± 0.02 | 31.6 ± 1.35 | 0.835 ± 0.02 | | ✓ | ✓ | Convert | 32.5 ± 0.92 | 0.865 ± 0.01 | 34.7 ± 0.99 | 0.896 ± 0.01 | 36.4 ± 0.78 | 0.918 ± 0.01 | | ✓ | ✗ | Wₜ | 38.4 ± 0.47 | 0.937 ± 0.01 | 37.9 ± 0.57 | 0.933 ± 0.01 | 38.2 ± 0.48 | 0.936 ± 0.01 |
As shown in Table 1, the global equilibrium framework substantially reduces the NFE budget needed to reach comparable reconstruction quality. With global equilibrium solving, ΠGDM achieves 31.7 dB at just 10 NFEs, nearly matching the 31.8 dB obtained by its non-DEQ counterpart using DDIM at 100 NFEs. Similarly, Convert achieves 32.5 dB at 10 NFEs, exceeding the 31.6 dB obtained with DDIM at 100 NFEs. These results demonstrate that the acceleration benefit also applies to plug-and-play variants Within the same global equilibrium framework, measurement-conditioned training provides further gains. Our full model achieves 38.4 dB at 10 NFEs, outperforming the ΠGDM and Convert variants by 6.7 and 5.9 dB, respectively. Increasing the budget to 50 or 100 NFEs yields no further PSNR improvement (37.9 and 38.2 dB, respectively). Thus, the DEQ framework enables comparable reconstruction quality with fewer NFEs, while joint measurement-conditioned training further improves the achievable quality.
Response to Reviewer qbMb (Part 3/3)
Weakness 3: The baseline comparisons are lacking.
Response: We sincerely appreciate your suggestion to include these additional baselines. We first compare our method with DAPS (Zhang et al., CVPR 2025) and PnP-DM (Wu et al., NeurIPS 2024), two state-of-the-art score-based inverse solvers. Given the strong performance of recent flow-based methods on inverse problems, we also include PnP-Flow (Martin et al., ICLR 2025) and Flower (Pourya et al., ICLR 2026). To further evaluate reconstruction quality under accelerated sampling, we compare against CoSIGN (Zhao et al., ECCV 2024) and VFM (Mammadov et al., ICLR 2026), which accelerate score-based and flow-based reconstruction, respectively. Here, we present the results for MPI reconstruction at an SNR of 10 dB. Please refer to the revised manuscript for additional results.
Table 2 MPI reconstruction at SNR = 10 dB (mean ± SD). | Method | NFEs | PSNR ↑ | SSIM ↑ | FPS ↑ | | --- | --- | --- | --- | --- | | DAPS | 2000 | 30.7 ± 4.37 | 0.907 ± 0.04 | 0.026 | | PnP-DM | 2070 | 30.9 ± 6.08 | 0.903 ± 0.09 | 0.044 | | PnP-Flow | 1000 | 32.0 ± 4.89 | 0.937 ± 0.06 | 0.085 | | Flower | 100 | 32.8 ± 4.83 | 0.938 ± 0.06 | 0.310 | | CoSIGN | 10 | 28.5 ± 4.51 | 0.621 ± 0.09 | 3.018 | | VFM | 10 | 30.4 ± 4.70 | 0.918 ± 0.05 | 6.589 | | DEQ-Solver (ours) | 10 | 32.9 ± 5.16 | 0.958 ± 0.03 | 6.330 |
Our DEQ-Solver achieves the highest PSNR and SSIM among the compared methods, reaching 32.9 dB and 0.958, respectively, with only 10 NFEs. In particular, it improves PSNR over DAPS and PnP-DM by 2.2 and 2.0 dB, respectively, while requiring substantially fewer NFEs. It also outperforms PnP-Flow, Flower on both reconstruction metrics. Compared with CoSIGN under the same budget of 10 NFEs, DEQ-Solver achieves an approximately 2.1× speedup (6.330 vs. 3.018 FPS) while improving PSNR by 4.4 dB. Although VFM achieves comparable reconstruction speed (6.589 FPS), its PSNR is 2.5 dB lower than that of DEQ-Solver. These results demonstrate a favorable trade-off between reconstruction quality and computational efficiency under low-SNR conditions.
Response to Reviewer qbMb (Part 1/3)
We sincerely appreciate your insightful and professional comments. In the following responses, we will try our best to address these concerns.
Weakness 1: How to train the posterior score estimator is unclear.
**Response: ** Yes, our method uses paired image–measurement data (x₀, y) for training. For MPI and CT, measurements are generated from reference images using the corresponding forward operators and noise models. For MRI, we use acquired k-space measurements paired with their corresponding reference images. As we cannot include a formatted algorithm here, please refer to Algorithm 1 in Appendix A.2 for a detailed description of the training procedure. The network sθ does not directly output the posterior score. Instead, it jointly predicts a measurement-aware denoising estimate and a spatial weighting map:
sθ([xₜ; Aᴴy], t) = [x̂₀; Wₜ].
Here, Aᴴy maps the measurement into the image domain and is concatenated with xₜ along the channel dimension. Compared with an unconditional network sθ(xₜ, t), the input is extended to include this measurement information, and the output is adapted to predict both x̂₀ and Wₜ. The weights are constrained to be positive through a bounded sigmoid parameterization. These outputs are then used in the CG-based data-consistency update to approximate E[x₀ | xₜ, y], from which the posterior score is computed using Proposition 1.
We train the resulting neural vector field within the deep equilibrium framework. For each training pair, we sample a time point from the logarithmic time grid and construct adjacent diffusion states using the forward perturbation process. The noisier state serves as a fixed boundary condition, and Anderson acceleration is used to solve for the equilibrium state at the preceding time point. The training objective combines supervision of this equilibrium state against the corresponding diffusion target with supervision of the denoising output against the reference image x₀. Gradients are approximated using the one-step phantom gradient method. Thus, the measurement-conditioned network is trained jointly with the reconstruction system. The spatial weighting map is learned through this training objective, without requiring separate covariance labels.