Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.12821 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915496804220928 |
|---|---|
| author | Zach, Martin Haouchat, Youssef Unser, Michael |
| author_facet | Zach, Martin Haouchat, Youssef Unser, Michael |
| contents | We propose a statistical benchmark for diffusion posterior sampling (DPS) algorithms for Bayesian linear inverse problems. The benchmark synthesizes signals from sparse Lévy-process priors whose posteriors admit efficient Gibbs methods. These Gibbs methods can be used to obtain gold-standard posterior samples that can be compared to the samples obtained by the DPS algorithms. By using the Gibbs methods for the resolution of the denoising problems in the reverse diffusion, the framework also isolates the error that arises from the approximations to the likelihood score. We instantiate the benchmark with the minimum-mean-squared-error optimality gap and posterior coverage tests and provide numerical experiments for popular DPS algorithms on the inverse problems of denoising, deconvolution, imputation, and reconstruction from partial Fourier measurements. We release the benchmark code at https://github.com/zacmar/dps-benchmark. The repository exposes simple plug-in interfaces, reference scripts, and config-driven runs so that new algorithms can be added and evaluated with minimal effort. We invite researchers to contribute and report results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_12821 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Statistical Benchmark for Diffusion Posterior Sampling Algorithms Zach, Martin Haouchat, Youssef Unser, Michael Signal Processing We propose a statistical benchmark for diffusion posterior sampling (DPS) algorithms for Bayesian linear inverse problems. The benchmark synthesizes signals from sparse Lévy-process priors whose posteriors admit efficient Gibbs methods. These Gibbs methods can be used to obtain gold-standard posterior samples that can be compared to the samples obtained by the DPS algorithms. By using the Gibbs methods for the resolution of the denoising problems in the reverse diffusion, the framework also isolates the error that arises from the approximations to the likelihood score. We instantiate the benchmark with the minimum-mean-squared-error optimality gap and posterior coverage tests and provide numerical experiments for popular DPS algorithms on the inverse problems of denoising, deconvolution, imputation, and reconstruction from partial Fourier measurements. We release the benchmark code at https://github.com/zacmar/dps-benchmark. The repository exposes simple plug-in interfaces, reference scripts, and config-driven runs so that new algorithms can be added and evaluated with minimal effort. We invite researchers to contribute and report results. |
| title | A Statistical Benchmark for Diffusion Posterior Sampling Algorithms |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2509.12821 |