- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
The paper proposes to "poissonize" generative diffusion models for inverse problems: instead of considering diffusion models where the noising process is Gaussian to learn a prior and sampling the posterior, the authors propose to develop diffusion models based on Poisson. The main motivation is compatibility with the observation model: since Gaussian diffusion for posterior sampling may exploit the Gaussian structure of the measurement law, the authors aim to investigate whether the switching to Poisson can be beneficial for solving Poisson inverse problems. While the first part of the paper defines Poisson diffusion models and compares them with Gaussian ones, the second part uses this theory for Poisson inverse problems: the authors start with a simple inverse problem (Poisson denoising with forward operator ), and then consider more challenging inverse problem to see whether a "Poissonian" approach is helpful.
Critical strengths
The paper is well written, and the mathematical content seems sound. Besides the general formulation of Poisson generative models, I believe it tackles an interesting problem: whether leveraging the inductive bias arising from compatibility with an observation model actually brings additional benefits in posterior sampling via diffusion-based generative models. The paper also includes experiments that help evaluate the Poissonian approach against the Gaussian one.
Critical weaknesses
The paper has the merit of raising several questions, but I personally did not find the answers fully satisfying. First, it shows that, for a simple Poisson-denoising example, Poisson denoising posterior sampling (PDPS) clearly outperforms the considered Gaussian-based samplers. This is interesting and seems to follow from Theorem 3, which holds, however, in very limited case, when the forward map ; see questions. For the other inverse problems considered in the paper, however, Theorem 3 is not available and additional approximations are needed. In such cases, there seems to be no clear advantage in using Poissonian generative models. These results leave unclear whether matching the generative dynamics with the measurement law provides an advantage beyond the simple setting of Theorem 3.
Questions for authors
- In the denoising problem covered by Theorem 3, what is the relation between PDPS and the approach of Krull et al. (2024) in Image Denoising and the Generative Accumulation of Photons?
- Why, in your opinion, does there not seem to be any clear advantage to using Poissianian rather Gaussian generative models for posterior sampling when the conditions of Theorem 3 are not satisfied? Do you think there is a way to study the mismatch in performance between Table 1 (where the Poissonian method is strikingly effective) and Table 2 (where there seems to be no clear indication that one approach is preferable to the other)?
- Can Theorem 3 be extended beyond the case ?
4 comments
A separate extension of Theorem 3 is available when is a diagonal matrix; however it requires to extend the definition of the denoiser to a vector-valued time . Then, for , ; with . So, theoretically, if one were to train an anisotropic denoiser, where each pixel is noised at a different level , instead of the isotropic one where for all , the exact conditional denoiser would be available without additional approximation. A similar idea is explored in [8] for Gaussian diffusion/Gaussian inverse problems. We will include a remark after the proof of Theorem 3; but we think this generalization lies beyond the scope of our manuscript, as it requires non-standard denoiser training.
In the denoising problem covered by Theorem 3, what is the relation between PDPS and the approach of Krull et al. (2024) in Image Denoising and the Generative Accumulation of Photons?
Thank you for pointing out this paper; it is an interesting related work, and we will mention it in the revised manuscript. While their approach and construction differ from both ours and the previous Poissonian generative models we identified in the paper [1,2], they also define and train a Poisson denoiser. They describe their sampling procedure as "predicting the next photon from an intermediary state"; this is reminiscent of the jump mechanism of counting processes. Their goal is to obtain posterior samples from a corrupted Poisson observation, which is also the objective of Theorem 3. However, they do not write a relationship between prior and posterior denoisers; they directly apply their photon arrival scheme to the observation. By contrast, PDPS (our algorithm that follows from Theorem 3) samples a mixed Poisson process from (the initial black image) and incorporates the observation into the denoiser.
[1] Sagnik Bhattacharya, Abhiram Gorle, Ahsan Bilal, Connor Ding, Amit Kumar Singh Yadav, and Tsachy Weissman. Itdpdm: Information-theoretic discrete poisson diffusion model. In D. Belgrave, C. Zhang, H. Lin, R. Pascanu, P. Koniusz, M. Ghassemi, and N. Chen, editors, Advances in Neural Information Processing Systems, volume 38, Main Conference, pages 10860–10915. Curran Associates, Inc., 2025.
[2] Tianqi Chen and Mingyuan Zhou. Learning to Jump: Thinning and Thickening Latent Counts for Generative Modeling. In Proceedings of the 40th International Conference on Machine Learning, pages 5367–5382. PMLR, July 2023. ISSN: 2640-3498
[8] Abbas Mammadov, Ozgur Kara, Kaan Oktay, Iskander Azangulov, Adil Kaan Akan, Hyungjin Chung, James Matthew Rehg, and Yee Whye Teh. Exact posterior score estimation for solving linear inverse problems, 2026.
I thank the authors for their explanation. The proposed extension to circulant operators is a valuable addition.
What remains unclear to me is the broader significance of the analysis. Why should we "poissonize" generative diffusion models for Poisson inverse problems? I would find the motivation stronger if the paper showed a concrete limitation of Gaussian diffusion models that the proposed approach can overcome in practice. However, the reconstruction results are mixed. I still think it is interesting that the paper gives a rigorous formulation of Poisson generative diffusion models and explores their application to inverse problems. But I also think that the paper in its current form gives practitioners little guidance on when to choose a Poisson generative model over a Gaussian diffusion model paired with the same Poisson likelihood.
We thank the reviewer for this comment.
Regarding the circulant operators extension, the revised manuscript includes a detailed derivation in Appendix D.6. To be precise, the extension covers operators of the form where A has equals column sums (in particular, this holds for circulant matrices), and is a background noise. Poissonian background noise is notably common in astronomy applications. The revised manuscript also includes toy experiments to illustrate this extension (similar to the one illustrating PDPS in the original manuscript): the resulting algorithm consistently outperfoms the baselines in term of Wasserstein distance. We will introduce this extension in the main text as well: it is a concrete exemple of the possibilities that arise from matching the noise structure. In particular, this specialized method relies on the Poisson structure of the likelihood and generative model and does not have a direct counterpart in a Gaussian generative model. From a practitioner point of view, opting for a Poisson generative model for Poisson inverse problems can enable specialized algorithms in certain cases, while still accomodating general forward operator.
We agree that identifying the settings in which Poisson-based generative models outperform Gaussian diffusion models is an important question, and notably that the advantages compared to Gaussian methods are not necessarely reflected in the results of Table 2. First, evaluating posterior samples remains challenging, and the reconstruction metrics reported in Table 2 should primarily be viewed as summary statistics providing a partial assessment of the methods. In our toy experiments, where more reliable evaluation metrics are available, we already observe that Poisson-based methods are substantially better suited to the problem than their Gaussian counterparts.
More importantly, the metrics reported in Table 2 assess the quality of individual samples rather than the posterior distribution as a whole. They do not necessarily capture posterior calibration or the quality of uncertainty quantification, particularly in the low-count regime, where the posterior distribution is more diffuse. For instance, a method may achieve good reconstruction scores while producing samples that are overly concentrated around the posterior mean. We illustrate this distinction through a new calibration experiment on the BrainWeb/PET dataset, presented in Appendix E.4 of our revised submission. Despite achieving competitive reconstruction metrics, Gaussian diffusion DPS substantially underestimates the presence of lesions, whereas our MPDM-based methods provide more accurate lesion detection.
We therefore believe that our experiments provide concrete evidence of the potential advantages of Poisson-based generative models for posterior sampling, even though these advantages are not systematically captured by standard image reconstruction metrics. We will clarify this point in the revised manuscript and better highlight the results of the toy experiments and the BrainWeb calibration study.
We hope that these additional explanations and results adequately address the reviewer's concerns, and we would be grateful if the reviewer could reconsider their assessment in light of this evidence.
Thank you for your positive comments on the paper's presentation, and your interest in the question we tackle regarding the matching structure of the generative model and the likelihood of the Bayesian inverse problem. Thank you also for saying that Theorem 3 and the associated numerical experiments are interesting.
Our experiments do not establish that posterior sampling methods based on Poissonian generative models are systematically better than Gaussian ones for a general forward operator A. We provide a detailed answer to your question regarding extensions of Theorem 3 below, where we show that the "structural correspondence" of Theorem 3 is still useful for more general operators (specifically, circulant matrices). We think this constitutes a concrete example of the benefit of matching the generative dynamics with the Poisson inverse problems, beyond the simple A=aId case.
First, regarding the general operator case, our objective is primarily to show that, beyond the favourable but admittedly limited scope of Theorem 3, several general-purpose Gaussian diffusion-based posterior sampling methods could be translated to the MPDM setting, and that the resulting algorithms were competitive for realistic Poisson inverse problems, which was a priori not obvious. The image reconstruction metrics reported in Table 2 do not necessarily reflect the quality of the approximate posterior distribution, but provide a simple way to verify that the proposed algorithms are viable. Ultimately, evaluation of posterior sample quality depends on the problem at hand. For instance, we report a calibration evaluation for the BrainWeb dataset in Appendix E.4 that assesses whether the sampling methods correctly detect lesions; we observe notably that despite its good image reconstruction metrics, the baseline (Gaussian) diffusion DPS is less effective compared to our MPDM-based methods (it tends to underestimate the presence of lesions). This is of course not proof that MPDM-based methods are systematically "better", but this shows that the image metrics of Table 2 are not the full story. Our point is that if someone trains a generative model with Poisson inverse problems in mind, opting for a Poissonian generative model rather than a classical Gaussian one is possible and potentially more principled.
Thank you for this question. When A=(aij) is a circulant matrix with non-negative coefficients, we can derive a specialized sampling algorithm that explicitly uses the correspondence between the Poissonian generative model and the likelihood. This case includes convolution-based blurring operators with periodic boundary conditions. We identified this extension after submitting the original manuscript. It shows that the case A=aId is not the only case where the connection with Poisson generative models is mathematically explicit. We will include this extension in the revised paper, after conducting illustrative experiments.
The idea is to use latent-count augmentation, as in, eg, [7]. Define cij∼P(aijxj) such that yi=∑jcij. Let Cj=∑icij; since all column sums of A are equal to a constant a, the augmented posterior (distribution of x,c given y) is
\pi(x)\times\prod_i 1\left(\sum_j c_{ij}=y_i\right) \times\prod_j e^{-ax_j}x_j^{C_j}\times \prod_{i,j}\frac{a_{ij}^{c_{ij}}}{c_{ij}!},$$ Given $x$ and $y_i$, $c_{i,...}$ follows a multinomial distribution $$c_{i,\ldots} \mid x,y_i \sim \text{Multinomial}\left( y_i, \left[ \frac{a_{ij}x_j}{(Ax)_i} \right]^{j=1,...,d} \right)$$ which can be sampled exactly. This part is already in [7]. The other conditional, the distribution of $x$ given $y,c$, is $$\pi(d x\vert c,y) \propto \pi(dx)\prod_j e^{-ax_j}x_j^{C_j}$$ This is the posterior distribution $\pi^C$ of $X\sim\pi$ given a Poisson observation $C\sim\mathcal{P}(aX)$! So Theorem 3 says \$ K_t^{\pi^C}(z)=K_{t+a}^{\pi}(z+C)\$ and we can sample from this conditional by simulating the associated MPP. This yields an approximate Gibbs sampler for the original posterior: alternate between sampling the latent counts from their multinomial conditional and an MPP simulation step. Compared with the general-purpose algorithms described in our paper, this approach avoids the denoiser/score approximation used in DPS and the Langevin MCMC likelihood step used in PnP-DM and DAPS. The latent-count augmentation itself is already in [7], where the multinomial step is the same. However, they use additional data augmentation and MCMC for the second step, while MPDM tackles it directly. [7] Elhadji Cisse Faye, Mame Diarra Fall, Nicolas Dobigeon, and Eric Barat. Bregman geometry-aware split gibbs sampling for bayesian poisson inverse problems, 2026.