Solving Linear Inverse Problems Provably via Posterior Sampling with Latent Diffusion Models
About
We present the first framework to solve linear inverse problems leveraging pre-trained latent diffusion models. Previously proposed algorithms (such as DPS and DDRM) only apply to pixel-space diffusion models. We theoretically analyze our algorithm showing provable sample recovery in a linear model setting. The algorithmic insight obtained from our analysis extends to more general settings often considered in practice. Experimentally, we outperform previously proposed posterior sampling algorithms in a wide variety of problems including random inpainting, block inpainting, denoising, deblurring, destriping, and super-resolution.
Litu Rout, Negin Raoof, Giannis Daras, Constantine Caramanis, Alexandros G. Dimakis, Sanjay Shakkottai• 2023
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Inpainting | FFHQ | LPIPS0.221 | 62 | |
| 4x super-resolution | FFHQ 256x256 | PSNR30.73 | 61 | |
| Gaussian Deblurring | FFHQ 256x256 (val) | LPIPS0.221 | 58 | |
| Super-Resolution (4x) | ImageNet | PSNR23.92 | 57 | |
| Motion Deblur | FFHQ | PSNR26.87 | 56 | |
| Super-Resolution | ImageNet 256 | PSNR7.77 | 50 | |
| Image Inpainting | FFHQ 256x256 (val) | FID43.11 | 47 | |
| Gaussian Deblurring | FFHQ | PSNR16.807 | 46 | |
| Super-Resolution (4x) | FFHQ | PSNR27.62 | 42 | |
| Gaussian Deblurring | ImageNet | SSIM0.212 | 41 |
Showing 10 of 118 rows
...