- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3(+2)
- Soundness
- 3(+1)
Read review
Paper summary
This work considers primal dual Plug-and-Play methods, which replace some regularization term in an operator splitting with a learned denoisers. The work is built from PDHG, the denoiser is assumed to be a Gaussian denoiser with variable noise, with the proposed algorithm injecting additional noise at each step. The authors then provide two theoretical results. The first shows convergence to critical points of some functional when the injected noise is decreasing, under standard assumptions in the literature, namely extending(?) previous analysis to the nonconvex case. The second then provides a recovery guarantee when the added noise is the same as the denoising strength. The proposed method is then compared with several diffusion based solvers.
Critical strengths
- Theory is reasonable and addresses different choices of injected noise. The main contribution Theorem 2 actually appears to be a recovery guarantee, in the specific case where the denoiser is given by a MMSE denoiser (with decreasing noise levels). This actually has interesting links to signal recovery [LT26]. Other similar works in the literature typically consider recovery under diffusion processes, rather than such iterative procedures.
[LT26] O. Leong and Y. Traonmilin. A Recovery Theory for Diffusion Priors: Deterministic Analysis of the Implicit Prior Algorithm. AISTATS'26
Critical weaknesses
- Clarity.
- The introduction does not serve to position this work relative to other related work, and reads instead like a general introduction to PnP. There are also several missing references.
- Section 2 is particularly difficult to read. Is there any particular reason why the proximal interpretation is introduced here? It is well known within the PnP literature that fixed points of many algorithms can be written as critical points of some functional, related to MAP estimates through the Bayesian interpretation. It would be much better to detail the differences of the proposed method (i.e. added noise at each step + decreasing denoiser variance) with more classical PnP methods using fixed denoisers. There should also be a review on diffusion-based PnP.
- Please rearrange the text so that the writing flows naturally, rather than having abrupt bold text in front of a paragraph. E.g. "Manifold hypothesis" in Section 4.1,
- Experimental section. Are the baselines tuned? I could not find an explanation in the appendix. It is well known that PnP (and by extension, RED) methods are sensitive to hyperparameters and stopping time.
- I would also be interested in Figure 2 but with the other compared methods as well, e.g. DiffPIR, which does not have to do potentially expensive dual iterations.
Questions for authors
- Are the in Theorem 2 equal to limit points of the PD algorithm? Can anything else be said about them, other than they sit on the data manifold? I suspect that this may be difficult since the score explodes as the variance goes to 0. This is related to Appendix G, uniform bound on in Prop 5 would not be feasible as variance goes to 0 in practice.
- Please clarify usage of "MAP estimate" in the case where your objective is nonconvex.
- Metrics increase but do not converge in the experimental section. Any demonstration of Theorem 1 convergence to fixed points?
- Consider rewriting Section 3.2 to have more motivation. It currently reads rather weakly as "PDHG -> replace a denoiser like PnP -> add noise because the literature says so".
- (Suggestion) Proposition 1 should probably highlight that even though the dual problem (8) is not equivalent to (2) if is nonconvex, if the primal iterations converge, then it converges to a critical point of the primal problem (2).
- (Suggestion) Visually demonstrate the variety of images that can be reconstructed from a given corruption. I see that Appendix K has statistics.
Missing references for PnP-PDHG should be added, e.g. [MMHC17] and associated works by Ono [Ono17].
[MMHC17] Meinhardt, T., Moller, M., Hazirbas, C., & Cremers, D. (2017). Learning proximal operators: Using denoising networks for regularizing inverse imaging problems. In Proceedings of the IEEE international conference on computer vision (pp. 1781-1790). [Ono17] Ono, S. (2017). Primal-dual plug-and-play image restoration. IEEE Signal Processing Letters, 24(8), 1108-1112.