This work introduces a sampling method capable of solving Bayesian inverse problems in function space. It does not assume the log-concavity of the likelihood, meaning that it is compatible with nonlinear inverse problems. The method leverages the recently defined infinite-dimensional score-based diffusion models as a learning-based prior, while enabling provable posterior sampling through a Langevin-type MCMC algorithm defined on function spaces. A novel convergence analysis is conducted, inspired by the fixed-point methods established for traditional regularization-by-denoising algorithms and compatible with weighted annealing. The obtained convergence bound explicitly depends on the approximation error of the score; a well-approximated score is essential to obtain a well-approximated posterior. Stylized and PDE-based examples are provided, demonstrating the validity of our convergence analysis. We conclude by presenting a discussion of the method's challenges related to learning the score and computational complexity.

在这项研究中，我们介绍了一种能够在函数空间中解决贝叶斯逆问题的抽样方法，它不需要似然函数的对数凹性，可以用于非线性逆问题。该方法利用了最近定义的无限维度基于得分的扩散模型作为基于学习的先验，并通过在函数空间上定义的Langevin类型的MCMC算法实现可证明的后验采样。我们进行了一项新颖的收敛性分析，受传统正则化-去噪算法中建立的不动点方法的启发，并与加权模拟退火兼容。所得到的收敛界明确依赖于得分的逼近误差；良好逼近的得分对于获得良好逼近的后验至关重要。我们提供了基于样式和基于PDE的示例，证明了我们的收敛性分析的有效性。最后，我们讨论了学习得分和计算复杂性方面的挑战。

驯服基于分数扩散的无限维非线性逆问题