arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1210.4884cs.LGstat.ML
收藏

潜在联合树的谱算法

A Spectral Algorithm for Latent Junction Trees

Carnegie Mellon University(卡内基梅隆大学);Georgia Tech(佐治亚理工学院);Gatsby Unit, UCL(伦敦大学学院盖茨比计算神经科学部)

Ankur P. Parikh, Le Song, Mariya Ishteva, Gabi Teodoru, Eric P. Xing

摘要:

潜变量模型是一个优雅的框架,用于在许多应用程序中捕获丰富的概率依赖关系。然而,目前的方法通常使用条件概率表来参数化这些模型,并且学习主要依赖于局部搜索算法,例如期望最大化。使用张量代数,我们提出了一种替代参数化的潜变量模型(模型结构是连接树),仍然允许计算观测变量之间的边际。虽然这种新的表示导致了适度增加的连接树的低树宽的参数的数量,它让我们设计一个本地最小的自由算法来学习这个参数化。该算法的主要计算仅涉及张量运算和SVD,对于大型数据集,其速度比EM算法快几个数量级。据我们所知,这是第一个可证明一致的参数学习技术的一大类低树宽潜在的图形模型超越树。我们证明了我们的方法在合成和真实数据集上的优势。

英文摘要:

Latent variable models are an elegant framework for capturing rich probabilistic dependencies in many applications. However, current approaches typically parametrize these models using conditional probability tables, and learning relies predominantly on local search heuristics such as Expectation Maximization. Using tensor algebra, we propose an alternative parameterization of latent variable models (where the model structures are junction trees) that still allows for computation of marginals among observed variables. While this novel representation leads to a moderate increase in the number of parameters for junction trees of low treewidth, it lets us design a local-minimum-free algorithm for learning this parameterization. The main computation of the algorithm involves only tensor operations and SVDs which can be orders of magnitude faster than EM algorithms for large datasets. To our knowledge, this is the first provably consistent parameter learning technique for a large class of low-treewidth latent graphical models beyond trees. We demonstrate the advantages of our method on synthetic and real datasets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑