Efficient Variational Bayesian Approximation Method Based on Subspace optimization

Abstract : Variational Bayesian approximations have been widely used in fully Bayesian inference for approx- imating an intractable posterior distribution by a separable one. Nevertheless, the classical variational Bayesian approximation (VBA) method suffers from slow convergence to the approximate solution when tackling large-dimensional problems. To address this problem, we propose in this paper an improved VBA method. Actually, variational Bayesian issue can be seen as a convex functional optimization problem. The proposed method is based on the adaptation of subspace optimization methods in Hilbert spaces to the function space involved, in order to solve this optimization problem in an iterative way. The aim is to determine an optimal direction at each iteration in order to get a more efficient method. We highlight the efficiency of our new VBA method and its application to image processing by considering an ill-posed linear inverse problem using a total variation prior. Comparisons with state of the art variational Bayesian methods through a numerical example show the notable improved computation time.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

Contributor : Aurélia Fraysse <>
Submitted on : Monday, May 12, 2014 - 6:31:09 PM
Last modification on : Thursday, February 7, 2019 - 2:26:08 PM
Long-term archiving on : Tuesday, August 12, 2014 - 12:15:27 PM


Files produced by the author(s)


  • HAL Id : hal-00990003, version 1


Yuling Zheng, Aurélia Fraysse, Thomas Rodet. Efficient Variational Bayesian Approximation Method Based on Subspace optimization. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2015, 24 (2), pp.681-693. ⟨hal-00990003⟩



Record views


Files downloads