Go to  Advanced Search

Herded Gibbs sampling

Show full item record

Files in this item

Files Size Format Description   View
ubc_2012_fall_fang_jing.pdf 1.267Mb Adobe Portable Document Format   View/Open
 
Title: Herded Gibbs sampling
Author: Fang, Jing
Degree Master of Science - MSc
Program Computer Science
Copyright Date: 2012
Publicly Available in cIRcle 2012-09-06
Abstract: The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this thesis, we introduce a herding variant of this algorithm that is entirely deterministic. We demonstrate, with simple examples, that herded Gibbs exhibits better convergence behavior for approximating the marginal distributions than Gibbs sampling. In particular, image denoising exemplifies the effectiveness of herded Gibbs as an inference technique for Markov Random Fields (MRFs). Also, we adopt herded Gibbs as the inference engine for Conditional Random Fields (CRFs) in Named Entity Recognition (NER) and show that it is competitive with the state of the art. The conclusion is that herded Gibbs, for graphical models with nodes of low degree, is very close to Gibbs sampling in terms of the complexity of the code and computation, but that it converges much faster.
URI: http://hdl.handle.net/2429/43188
Scholarly Level: Graduate

This item appears in the following Collection(s)

Show full item record

All items in cIRcle are protected by copyright, with all rights reserved.

Attribution-NonCommercial 2.5 Canada Except where otherwise noted, this item's license is described as Attribution-NonCommercial 2.5 Canada

UBC Library
1961 East Mall
Vancouver, B.C.
Canada V6T 1Z1
Tel: 604-822-6375
Fax: 604-822-3893