Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference

Statistics – Machine Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 3 figures, submitted for conference publication

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Convergent Algorithms for Expectation Propagation Approximate Bayesian Inference will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-219159

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.