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

SpectralLeader:单主题模型的在线谱学习

SpectralLeader: Online Spectral Learning for Single Topic Models

Carnegie Mellon University(卡内基梅隆大学);Adobe Research(奥多比研究院);Google DeepMind(谷歌DeepMind)

Tong Yu, Branislav Kveton, Zheng Wen, Hung Bui, Ole J. Mengshoel

摘要:

研究了从数据流中学习隐变量模型的问题。潜变量模型在实践中很受欢迎,因为它们可以用未观察到的概念来解释观察到的数据。这些模型传统上是在离线环境中研究的。另一方面,在在线设置中,在线EM可以说是学习潜变量模型的最流行的算法。虽然在线EM计算效率高,但它通常收敛到局部最优。在这项工作中,我们开发了一个新的在线学习算法的潜变量模型,我们称之为SpectralLeader。SpectralLeader总是收敛到全局最优解,并且在词袋模型下得到了它的$n$步后悔率的一个次线性上界.在合成和现实世界的实验中,我们表明,SpectralLeader执行类似或优于在线EM与调谐超参数。

英文摘要:

We study the problem of learning a latent variable model from a stream of data. Latent variable models are popular in practice because they can explain observed data in terms of unobserved concepts. These models have been traditionally studied in the offline setting. In the online setting, on the other hand, the online EM is arguably the most popular algorithm for learning latent variable models. Although the online EM is computationally efficient, it typically converges to a local optimum. In this work, we develop a new online learning algorithm for latent variable models, which we call SpectralLeader. SpectralLeader always converges to the global optimum, and we derive a sublinear upper bound on its $n$-step regret in the bag-of-words model. In both synthetic and real-world experiments, we show that SpectralLeader performs similarly to or better than the online EM with tuned hyper-parameters.

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

↑