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

走向大主题建模

Towards Big Topic Modeling

Soochow University(苏州大学);City University of Hong Kong(香港城市大学)

Jian-Feng Yan, Jia Zeng, Zhi-Qiang Liu, Yang Gao

摘要:

为了解决大主题建模问题,需要降低批处理潜在狄利克雷分配(LDA)算法的时间复杂度和空间复杂度。虽然多处理器结构上的并行LDA算法具有较低的时间复杂度和空间复杂度,但其处理器间的通信开销往往与词汇量和主题数成线性关系,导致严重的可扩展性问题。为了降低处理器之间的通信复杂性,提高系统的可扩展性,提出了一种基于幂律的通信高效的并行主题建模体系结构。我们提出的通信效率的并行架构与在线信念传播(OBP)算法被称为POBP大主题建模任务。大量的实验结果证实,POBP具有以下优点,以解决大主题建模问题:1)高精度,2)通信效率,3)速度快,和4)恒定的内存使用时,与最近的国家的最先进的并行LDA算法在多处理器架构。

英文摘要:

To solve the big topic modeling problem, we need to reduce both time and space complexities of batch latent Dirichlet allocation (LDA) algorithms. Although parallel LDA algorithms on the multi-processor architecture have low time and space complexities, their communication costs among processors often scale linearly with the vocabulary size and the number of topics, leading to a serious scalability problem. To reduce the communication complexity among processors for a better scalability, we propose a novel communication-efficient parallel topic modeling architecture based on power law, which consumes orders of magnitude less communication time when the number of topics is large. We combine the proposed communication-efficient parallel architecture with the online belief propagation (OBP) algorithm referred to as POBP for big topic modeling tasks. Extensive empirical results confirm that POBP has the following advantages to solve the big topic modeling problem: 1) high accuracy, 2) communication-efficient, 3) fast speed, and 4) constant memory usage when compared with recent state-of-the-art parallel LDA algorithms on the multi-processor architecture.

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

↑