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.
Solving Linear Inverse Problems Provably via Posterior Sampling with Latent Diffusion Models
A framework using pre-trained latent diffusion models for linear inverse problems outperforms existing posterior sampling methods across various tasks.
- Year
- 2023
- Venue
- solving-linear-inverse-problems-provably-via
- Authors
- 6
- Hosting
- Abstract onlyARXIV-DEFAULT
Cite
Notes
Only stored in your browser.
Attribution
- Abstract & full text
- arxiv.org/abs/2307.00619ARXIV-DEFAULT
- TL;DR
- Semantic Scholar