On the well-posedness of Bayesian inverse problems

• Published in: arXiv.org
• Main Author: Latz, Jonas
• Format: Paper Journal Article
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 11.09.2019
• Subjects: Bayesian analysis; Black boxes; Computer Science - Numerical Analysis; Divergence; Inverse problems; Mathematical analysis; Mathematical models; Mathematics - Numerical Analysis; Mathematics - Statistics Theory; Random noise; Stability criteria; Statistics - Machine Learning; Statistics - Theory; Well posed problems
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.1902.10257

The subject of this article is the introduction of a new concept of well-posedness of Bayesian inverse problems. The conventional concept of (Lipschitz, Hellinger) well-posedness in [Stuart 2010, Acta Numerica 19, pp. 451-559] is difficult to verify in practice and may be inappropriate in some contexts. Our concept simply replaces the Lipschitz continuity of the posterior measure in the Hellinger distance by continuity in an appropriate distance between probability measures. Aside from the Hellinger distance, we investigate well-posedness with respect to weak convergence, the total variation distance, the Wasserstein distance, and also the Kullback--Leibler divergence. We demonstrate that the weakening to continuity is tolerable and that the generalisation to other distances is important. The main results of this article are proofs of well-posedness with respect to some of the aforementioned distances for large classes of Bayesian inverse problems. Here, little or no information about the underlying model is necessary; making these results particularly interesting for practitioners using black-box models. We illustrate our findings with numerical examples motivated from machine learning and image processing.