English

Fast Samplers for Inverse Problems in Iterative Refinement Models

Computer Vision and Pattern Recognition 2024-11-04 v2 Machine Learning Machine Learning

Abstract

Constructing fast samplers for unconditional diffusion and flow-matching models has received much attention recently; however, existing methods for solving inverse problems, such as super-resolution, inpainting, or deblurring, still require hundreds to thousands of iterative steps to obtain high-quality results. We propose a plug-and-play framework for constructing efficient samplers for inverse problems, requiring only pre-trained diffusion or flow-matching models. We present Conditional Conjugate Integrators, which leverage the specific form of the inverse problem to project the respective conditional diffusion/flow dynamics into a more amenable space for sampling. Our method complements popular posterior approximation methods for solving inverse problems using diffusion/flow models. We evaluate the proposed method's performance on various linear image restoration tasks across multiple datasets, employing diffusion and flow-matching models. Notably, on challenging inverse problems like 4x super-resolution on the ImageNet dataset, our method can generate high-quality samples in as few as 5 conditional sampling steps and outperforms competing baselines requiring 20-1000 steps. Our code will be publicly available at https://github.com/mandt-lab/c-pigdm

Keywords

Cite

@article{arxiv.2405.17673,
  title  = {Fast Samplers for Inverse Problems in Iterative Refinement Models},
  author = {Kushagra Pandey and Ruihan Yang and Stephan Mandt},
  journal= {arXiv preprint arXiv:2405.17673},
  year   = {2024}
}

Comments

43 pages, NeurIPS'24 Camera Ready

R2 v1 2026-06-28T16:42:58.482Z