(remi.laumont@parisdescartes.fr, andres. almansa@parisdescartes.fr). * (valentin. debortoli@gmail.com). ? (julie.delon@parisedescartes.fr). ? (alain.durmus@ cmla.ens-cachan.fr). Il(m.pereyra@hw.ac.uk).

Since the seminal work of Venkatakrishnan, Bouman, and Wohlberg [Proceedings of the Global Conmethods have become ubiquitous in Bayesian imaging. These methods derive estimators for inverse problems in imaging by combining an explicit likelihood function with a prior that is implicitly defined by an image denoising algorithm. In the case of optimization schemes, some recent works guarantee the convergence to a fixed point, albeit not necessarily a maximum a posteriori Bayesian estimate. In the case of Monte Carlo sampling schemes for general Bayesian computation, to the best of our knowledge there is no known proof of convergence. Algorithm convergence issues aside, there are important open questions regarding whether the underlying Bayesian models and estimators are well defined, are well posed, and have the basic regularity properties required to support efficient Bayesian computation schemes. This paper develops theory for Bayesian analysis and computation with PnP priors. We introduce PnP-ULA (Plug & Play unadjusted Langevin algorithm) for Monte Carlo sampling and minimum mean square error estimation. Using recent results on the quantitative convergence of Markov chains, we establish detailed convergence guarantees for this algorithm under realistic assumptions on the denoising operators used, with special attention to denoisers based on deep neural networks. We also show that these algorithms approximately target a decision-theoretically optimal Bayesian model that is well posed and meaningful from a frequentist viewpoint. PnP-ULA is demonstrated on several canonical problems such as image deblurring and inpainting, where it is used for point estimation as well as for uncertainty visualization and quantification.