Posterior sampling via Langevin dynamics based on generative priors
<|reference_start|>Posterior sampling via Langevin dynamics based on generative priors: Posterior sampling in high-dimensional spaces using generative models holds significant promise for various applications, including but not limited to inverse problems and guided generation tasks. Despite many recent developments, generating diverse posterior samples remains a challenge, as existing methods require restarting the entire generative process for each new sample, making the procedure computationally expensive. In this work, we propose efficient posterior sampling by simulating Langevin dynamics in the noise space of a pre-trained generative model. By exploiting the mapping between the noise and data spaces which can be provided by distilled flows or consistency models, our method enables seamless exploration of the posterior without the need to re-run the full sampling chain, drastically reducing computational overhead. Theoretically, we prove a guarantee for the proposed noise-space Langevin dynamics to approximate the posterior, assuming that the generative model sufficiently approximates the prior distribution. Our framework is experimentally validated on image restoration tasks involving noisy linear and nonlinear forward operators applied to LSUN-Bedroom (256 x 256) and ImageNet (64 x 64) datasets. The results demonstrate that our approach generates high-fidelity samples with enhanced semantic diversity even under a limited number of function evaluations, offering superior efficiency and performance compared to existing diffusion-based posterior sampling techniques.<|reference_end|>
@article{purohit2024posterior,
    title={Posterior sampling via Langevin dynamics based on generative priors},
    author={Vishal Purohit, Matthew Repasky, Jianfeng Lu, Qiang Qiu, Yao Xie,
  Xiuyuan Cheng},
    journal={arXiv preprint arXiv:2410.02078},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.02078},
    primaryClass={stat.ML cs.CV cs.LG}
}