- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes RED–Atomic, a noise-domain diffusion regularization framework that combines a learned non-Gaussian noise model with an explicit atomic-norm signal prior for gridless line spectral estimation.
Critical strengths
The framework offers a principled variational and MAP interpretation while preserving known signal structure, with analytic calibration that usefully distinguishes score-learning error from diffusion-smoothing bias.
Critical weaknesses
-
The experimental evidence is not sufficiently convincing. Evaluation is restricted to small synthetic line spectral estimation problems, without validation on real measurements. This leaves the practical benefits under realistic noise unclear. Beyond real data from the target application, extensions to image denoising benchmarks such as SIDD [1] and the Fluorescence Microscopy Denoising (FMD) dataset [2] would strengthen the evidence, with appropriate adaptation of the signal prior and noise model.
-
The methodological novelty appears limited. RED/RED-diff and primal–dual splitting are established techniques. The main algorithmic contribution combines a diffusion-based noise model with a classical atomic-norm signal prior, which remains unchanged. Although the noise-domain variational derivation provides useful justification, the paper does not sufficiently demonstrate a substantial methodological advance beyond this combination of existing components.
-
Optimization stability and convergence remain insufficiently established. The diffusion-based noise fidelity can be nonconvex, raising concerns about sensitivity to initialization and step sizes. Moreover, Appendix B.4 only characterizes the limiting fixed point if the iterates converge; it does not establish convergence for the general learned-score implementation. A nonconservative learned score field further weakens the connection between this fixed point and a MAP solution.
References
[1] Abdelrahman Abdelhamed, Stephen Lin, and Michael S. Brown. “A High-Quality Denoising Dataset for Smartphone Cameras.” CVPR, 2018.
[2] Yide Zhang, Yinhao Zhu, Evan Nichols, Qingfei Wang, Siyuan Zhang, Cody Smith, and Scott Howard. “A Poisson-Gaussian Denoising Dataset with Real Fluorescence Microscopy Images.” CVPR, 2019.
Questions for authors
see weakness
3 comments
Comment 2: The methodological novelty appears limited. RED/RED-diff and primal–dual splitting are established techniques. The main algorithmic contribution combines a diffusion-based noise model with a classical atomic-norm signal prior, which remains unchanged. Although the noise-domain variational derivation provides useful justification, the paper does not sufficiently demonstrate a substantial methodological advance beyond this combination of existing components.
Response:
Our main contribution is the deterministic optimization framework in the noise domain and its theoretical justification.
First, our method is not a diffusion-based posterior-sampling method. We learn the noise score from noise-only samples, construct an effective noise likelihood, and combine it with an explicitly specified signal prior to obtain a deterministic structured estimator.
Second, we rigorously derive the zero-dispersion limiting noise-domain objective from the finite-dispersion RED-diff formulation. In RED-diff [1], the authors simplify the objective by setting . At this point, the variational Gaussian distribution degenerates into a Dirac measure, whose KL divergence with respect to a continuous density is infinite. Our theoretical analysis rigorously establishes this limiting procedure, rather than treating the resulting optimization problem as a heuristic.
Furthermore, we prove that the resulting optimization problem is a MAP estimator under the effective likelihood, providing a clear statistical interpretation of the resulting optimization problem.
Third, the proposed framework is general. It can be applied to denoising in general linear inverse problems with an explicitly specified signal prior, rather than being restricted to gridless line spectral denoising. For example, it can be applied to denoising problems in compressed sensing [2] and low-rank matrix recovery [3].
Finally, we show how the proposed denoising framework can be combined with a spectral-sparsity prior and applied to gridless line spectral denoising through RED–Atomic. The primal–dual splitting method is only one of the algorithms for solving this problem. Therefore, the application of primal-dual splitting is merely an algorithmic choice, rather than the core contribution of this paper.
We hope this clarification helps the reviewer better understand the main contributions of our work.
References for Comment 2:
[1] Mardani, M., Song, J., Kautz, J., and Vahdat, A. (2024). A Variational Perspective on Solving Inverse Problems with Diffusion Models. ICLR 2024.
[2] Baraniuk, R. G., Cevher, V., Duarte, M. F., and Hegde, C. (2010). Model-Based Compressive Sensing. IEEE Transactions on Information Theory, 56(4), 1982–2001.
[3] Candès, E. J., and Recht, B. (2009). Exact Matrix Completion via Convex Optimization. Foundations of Computational Mathematics, 9, 717–772.
Comment 3: The diffusion-based noise fidelity can be nonconvex, raising concerns about sensitivity to initialization and step sizes. Appendix B.4 only characterizes the limiting fixed point if the iterates converge; it does not establish convergence for the general learned-score implementation. A nonconservative learned score field further weakens the connection between this fixed point and a MAP solution.
Response: We thank the reviewer for raising these concerns. We have conducted additional experiments and clarified the scope and generality of the proposed framework.
1. Initialization and step-size sensitivity.
We have added initialization and step-size experiments for RED–Atomic under nonconvex Bernoulli–Gaussian noise. We evaluate five initializations and three primal step-size factors (0.50, 0.75, and 1.00) at 5 and 10 dB. The maximum relative variations in frequency RMSE are summarized as follows.
| Experiment | 5 dB | 10 dB |
|---|---|---|
| Five initializations | 0.002% | 0.010% |
| Three step-size factors (900 iterations) | 0.105% | 0.125% |
The RMSE differences are negligible across the tested settings. Smaller step sizes, however, require more iterations to satisfy the stopping criteria. After extending the iteration budget to 2,000, the recovery accuracy becomes comparable across the tested step sizes.
2. Generality of the effective MAP framework and optimization algorithms.
Appendix B discusses the convergence guarantees of the primal–dual algorithm under standard convexity and step-size assumptions. These guarantees do not generally extend to nonconvex effective fidelities.
However, the proposed effective MAP framework can be applied to general additive-noise inverse problems with explicitly specified signal priors.
For example, in compressed sensing, an -norm prior gives
FISTA [1] and ADMM [2] can be applied for solving this problem. However, their convergence guarantees hold when is convex. In nonconvex cases, their general convergence guarantees no longer follow without additional assumptions [3],[4].
In fact, establishing convergence guarantees for nonconvex optimization is inherently challenging, and existing results typically rely on stringent structural and algorithm-specific assumptions [5]. Moreover, sensitivity to initialization and step sizes is a well-recognized challenge in nonconvex optimization [6]. Therefore, the absence of general convergence guarantees, as well as the sensitivity of RED–Atomic to initialization and step sizes for arbitrary nonconvex problems is a broader challenge in the field rather than a limitation specific to our framework.
3. Estimation error bounds and scope of this work.
Appendix C characterizes the equilibrium conditions of the general learned-field implementation. We further establish an objective-gap bound when the effective likelihood is convex and a solution-distance bound under strong convexity. However, for nonconvex effective fidelities, no corresponding estimation-error guarantees can be established without additional structural assumptions.
Finally, our primary contribution is the effective MAP formulation and its integration with explicit priors, rather than a universal robust nonconvex solver. Developing optimization algorithms with stronger convergence guarantees for specific nonconvex problems is an important but separate research direction.
We hope that the additional experiments and clarifications adequately address the concerns raised and demonstrate the value of our work. Thank you again for your time and consideration.
References
[1] Amir Beck and Marc Teboulle. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems. SIAM Journal on Imaging Sciences, 2(1):183–202, 2009.
[2] Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein. Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers. Foundations and Trends in Machine Learning, 3(1):1–122, 2011.
[3] Hédy Attouch, Jérôme Bolte, and Benar Fux Svaiter. Convergence of Descent Methods for Semi-Algebraic and Tame Problems: Proximal Algorithms, Forward–Backward Splitting, and Regularized Gauss–Seidel Methods. Mathematical Programming, 137(1–2):91–129, 2013.
[4] Mingyi Hong, Zhi-Quan Luo, and Meisam Razaviyayn. Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems. SIAM Journal on Optimization, 26(1):337–364, 2016.
[5] Jérôme Bolte, Shoham Sabach, and Marc Teboulle. Proximal Alternating Linearized Minimization for Nonconvex and Nonsmooth Problems. Mathematical Programming, 146(1–2):459–494, 2014.
[6] Rina Foygel Barber and Wooseok Ha. Gradient Descent with Non-Convex Constraints: Local Concavity Determines Convergence. Information and Inference: A Journal of the IMA, 7(4):755–806, 2018.
Response to Reviewer 8Yc9
General Response:
We sincerely thank the reviewer for the constructive feedback. We have revised the manuscript and added experiments to address the concerns regarding experimental evidence, methodological contributions, and optimization stability. If our responses have addressed your concerns, we would greatly appreciate your reconsideration of the overall rating. Below, we provide detailed responses to each comment.
Comment 1: The experimental evidence is not sufficiently convincing. Evaluation is restricted to small synthetic line spectral estimation problems, without validation on real measurements. This leaves the practical benefits under realistic noise unclear. Beyond real data from the target application, extensions to image denoising benchmarks such as SIDD [1] and the Fluorescence Microscopy Denoising (FMD) dataset [2] would strengthen the evidence, with appropriate adaptation of the signal prior and noise model.
Response:
We thank the reviewer for the suggestion to broaden the scope of our paper. First, SIDD [1] and FMD [2] are valuable datasets, but their noise models do not directly match ours. Our observation model assumes that the noise distribution is independent of the signal x . The noise level function in SIDD is signal-dependent and satisfies β2(x)=β1x+β2, whereas the noise in FMD satisfies ni=np(xi)+ng. Therefore, both noise distributions depend on the conditional likelihood p(n∣x), which is beyond the scope of our current model.
Appendix E adds a controlled RGB experiment on ten clean images (Kodak 02–08 [3] and CBSD68 0001–0003 [4]). Noise is sampled independently of the clean images from the pretrained RGB-MNIST diffusion model released by Stevens et al. [5]. The full-resolution noise images are assembled from a library of 64×64 patches.
We adopt the collaborative color total variation (CTV) prior T=TV∞,1,1 proposed in [6,7] as the image prior, which has been evaluated on the Kodak collection for various image restoration tasks [6]. Specifically, the prior is defined as
\max_{c\in\{R,G,B\}}|\Delta_d x_c(p)|.$$ It couples gradients across color channels and encourages shared edges. RED-TV and Gaussian+TV [6,7] use the same CTV prior and differ only in their data-fidelity terms. Specifically, Gaussian+TV uses the quadratic fidelity $D(r)=\|r\|_2^2/2$, whereas RED-TV uses the learned effective-noise fidelity. The denoising results are summarized in the following table. Full image denoising results are provided in Appendix E. RED-TV improves PSNR on all ten images, with an **average gain of 7.51 dB**. The results show that our effective-likelihood MAP framework also performs well in image denoising. **This also demonstrates the generality of the proposed framework.** | Metric | Observation | Gaussian+TV | RED-TV | |:---|---:|---:|---:| | PSNR (dB) | 18.89 | 18.91 | 26.42 | --- **References for Comment 1:** [1] Abdelhamed, A., Lin, S., and Brown, M. S. (2018). A High-Quality Denoising Dataset for Smartphone Cameras. *CVPR*. [2] Zhang, Y. et al. (2019). A Poisson-Gaussian Denoising Dataset With Real Fluorescence Microscopy Images. *CVPR*. [3] Kodak. Kodak Lossless True Color Image Suite. https://r0k.us/graphics/kodak/ [4] Martin, D., Fowlkes, C., Tal, D., and Malik, J. (2001). A Database of Human Segmented Natural Images and its Application to Evaluating Segmentation Algorithms and Measuring Ecological Statistics. *ICCV*, 416–423. CBSD68 dataset: https://github.com/clausmichele/CBSD68-dataset [5] Stevens, T. S. W. et al. (2025). Removing Structured Noise using Diffusion Models. *Transactions on Machine Learning Research*. Paper: https://openreview.net/forum?id=BvKYsaOVEn. Code: https://github.com/tristan-deep/joint-diffusion [6] Duran, J., Moeller, M., Sbert, C., and Cremers, D. (2016). Collaborative Total Variation: A General Framework for Vectorial TV Models. *SIAM Journal on Imaging Sciences*, 9(1), 116–151. https://doi.org/10.1137/15M102873X [7] Duran, J., Moeller, M., Sbert, C., and Cremers, D. (2016). On the Implementation of Collaborative TV Regularization: Application to Cartoon+Texture Decomposition. *Image Processing On Line*, 6, 27–74. https://doi.org/10.5201/ipol.2016.141