Latent variable models are widely used in applications ranging from natural language processing to recommender systems. Exact inference using maximum likelihood for these models is generally NP-hard, and computationally prohibitive on big and/or high-dimensional data. This has motivated the development of approximate inference methods that balance between computational complexity and statistical efficiency. Understanding the computational and statistical tradeoff is important for analyzing approximate inference approaches as well as designing new ones.
Ph. D. Defense
3232 French Family Science Center
Date and Time