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

在MapReduce上实现机器学习算法的通用乘法方法

Generic Multiplicative Methods for Implementing Machine Learning Algorithms on MapReduce

University of Bristol(布里斯托大学);Tokyo Institute of Technology(东京工业大学)

Song Liu, Peter Flach, Nello Cristianini

摘要:

在本文中,我们介绍了一个通用的模型乘法算法,这是适用于MapReduce并行编程范式。我们实现了三种典型的机器学习算法来演示相似性比较、梯度下降、幂方法和其他经典学习技术如何很好地适应这个模型。本文讨论了大规模矩阵乘法的两个版本,并根据它们独特的计算特性和问题设置,为这两种情况开发了不同的方法。与早期的研究相比,我们专注于基本的线性代数技术,为一系列算法建立通用的方法,而不是一次一个地扩展算法的具体方法。实验表明,有前途的结果时,评估的加速比和准确性。与最坏情况下计算复杂性度为$O(m^3)$的标准实现相比,大规模矩阵乘法实验证明了我们的设计是相当高效的,并且随着核数的增加保持了良好的加速比。特定于IBM的实验也在运行时性能方面产生了令人鼓舞的结果。

英文摘要:

In this paper we introduce a generic model for multiplicative algorithms which is suitable for the MapReduce parallel programming paradigm. We implement three typical machine learning algorithms to demonstrate how similarity comparison, gradient descent, power method and other classic learning techniques fit this model well. Two versions of large-scale matrix multiplication are discussed in this paper, and different methods are developed for both cases with regard to their unique computational characteristics and problem settings. In contrast to earlier research, we focus on fundamental linear algebra techniques that establish a generic approach for a range of algorithms, rather than specific ways of scaling up algorithms one at a time. Experiments show promising results when evaluated on both speedup and accuracy. Compared with a standard implementation with computational complexity $O(m^3)$ in the worst case, the large-scale matrix multiplication experiments prove our design is considerably more efficient and maintains a good speedup as the number of cores increases. Algorithm-specific experiments also produce encouraging results on runtime performance.

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

↑