Go to  Advanced Search

Variational learning for latent Gaussian model of discrete data

Show full item record

Files in this item

Files Size Format Description   View
ubc_2013_spring_khan_mohammad.pdf 1.899Mb Adobe Portable Document Format   View/Open
 
Title: Variational learning for latent Gaussian model of discrete data
Author: Khan, Mohammad
Degree Doctor of Philosophy - PhD
Program Computer Science
Copyright Date: 2012
Publicly Available in cIRcle 2012-12-01
Abstract: This thesis focuses on the variational learning of latent Gaussian models for discrete data. The learning is difficult since the discrete-data likelihood is not conjugate to the Gaussian prior. Existing methods to solve this problem are either inaccurate or slow. We consider a variational approach based on evidence lower bound optimization. We solve the following two main problems of the variational approach: the computational inefficiency associated with the maximization of the lower bound and the intractability of the lower bound. For the first problem, we establish concavity of the lower bound and design fast learning algorithms using concave optimization. For the second problem, we design tractable and accurate lower bounds, some of which have provable error guarantees. We show that these lower bounds not only make accurate variational learning possible, but can also give rise to algorithms with a wide variety of speed-accuracy trade-offs. We compare various lower bounds, both theoretically and experimentally, giving clear design guidelines for variational algorithms. Through application to real-world data, we show that the variational approach can be more accurate and faster than existing methods.
URI: http://hdl.handle.net/2429/43640
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.

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