Variational Reformulation of Bayesian Inverse Problems
Machine Learning
2014-10-22 v1
Abstract
The classical approach to inverse problems is based on the optimization of a misfit function. Despite its computational appeal, such an approach suffers from many shortcomings, e.g., non-uniqueness of solutions, modeling prior knowledge, etc. The Bayesian formalism to inverse problems avoids most of the difficulties encountered by the optimization approach, albeit at an increased computational cost. In this work, we use information theoretic arguments to cast the Bayesian inference problem in terms of an optimization problem. The resulting scheme combines the theoretical soundness of fully Bayesian inference with the computational efficiency of a simple optimization.
Cite
@article{arxiv.1410.5522,
title = {Variational Reformulation of Bayesian Inverse Problems},
author = {Panagiotis Tsilifis and Ilias Bilionis and Ioannis Katsounaros and Nicholas Zabaras},
journal= {arXiv preprint arXiv:1410.5522},
year = {2014}
}