Loading...
conference paper
Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference
2011
Artificial Intelligence and Statistics 14
We propose a novel algorithm to solve the expectation propagation relaxation of Bayesian inference for continuous-variable graphical models. In contrast to most previous algorithms, our method is provably convergent. By marrying convergent EP ideas from (Opper&Winther 05) with covariance decoupling techniques (Wipf&Nagarajan 08, Nickisch&Seeger 09), it runs at least an order of magnitude faster than the most commonly used EP solver.
Loading...
Name
aist11_fastep.pdf
Access type
openaccess
Size
897.58 KB
Format
Adobe PDF
Checksum (MD5)
fe9743815be5acb5e62d2aa581d5ec05