0


层次狄利克雷过程的在线变分推理

Online Variational Inference for the Hierarchical Dirichlet Process
课程网址: http://videolectures.net/aistats2011_wang_online/  
主讲教师: Chong Wang
开课单位: 普林斯顿大学
开课时间: 信息不详。欢迎您在右侧留言补充。
课程语种: 英语
中文简介:
分层狄利克雷过程(HDP)是一种贝叶斯非参数模型,可以用来建模具有无限个潜在组件的混合隶属度数据。它广泛应用于概率主题建模,其中数据是文档,组件是反映集合中重复出现的模式(或主题)的术语分布。给定文档集合,后验推理用于确定所需主题的数量并描述它们的分布。HDP分析的一个局限性是,现有的后验推理算法需要多次遍历所有数据和mdash;对于非常大规模的应用来说,这些算法是难以处理的。提出了一种适用于海量流式数据的HDP在线变分推理算法。我们的算法比传统的HDP推理算法要快得多,并且可以分析更大的数据集。我们在两大文本集合上演示了该方法,显示了与HDP主题模型的有限对等物online LDA相比的性能改进。
课程简介: The hierarchical Dirichlet process (HDP) is a Bayesian nonparametric model that can be used to model mixed-membership data with a potentially infinite number of components. It has been applied widely in probabilistic topic modeling, where the data are documents and the components are distributions of terms that reflect recurring patterns (or “topics”) in the collection. Given a document collection, posterior inference is used to determine the number of topics needed and to characterize their distributions. One limitation of HDP analysis is that existing posterior inference algorithms require multiple passes through all the data—these algorithms are intractable for very large scale applications. We propose an online variational inference algorithm for the HDP, an algorithm that is easily applicable to massive and streaming data. Our algorithm is significantly faster than traditional inference algorithms for the HDP, and lets us analyze much larger data sets. We illustrate the approach on two large collections of text, showing improved performance over online LDA, the finite counterpart to the HDP topic model.
关 键 词: 狄利克雷; 在线变分推理
课程来源: 视频讲座网
最后编审: 2019-10-30:cwx
阅读次数: 185