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

机器学习算法的数据访问模式和计算冗余

Reviewing Data Access Patterns and Computational Redundancy for Machine Learning Algorithms

ExaScience Life Lab(埃克萨科学生命实验室);IMEC(IMEC(微电子与数字创新中心))

Imen Chakroun, Tom Vander Aa, Tom Ashby

摘要:

机器学习(ML)可能是处理新一代数据的大小和复杂性的首要技术。在本文中,我们分析的手段之一,以提高ML算法的性能是利用数据局部性。由于使用某些硬件技术来提高性能,数据局部性和访问模式通常是计算系统中性能问题的核心。改变访问模式以增加局部性可以显著提高给定算法的性能。此外,重复的数据访问可以被视为数据移动中的冗余。类似地,在计算的重复中也可能存在冗余。这项工作还确定了一些机会,避免这些冗余直接重用计算结果。我们记录的可能性,这种重用在一些选定的机器学习算法,并给出初步的指示性结果,从我们的第一个实验数据访问的改进和算法的重新设计。

英文摘要:

Machine learning (ML) is probably the first and foremost used technique to deal with the size and complexity of the new generation of data. In this paper, we analyze one of the means to increase the performances of ML algorithms which is exploiting data locality. Data locality and access patterns are often at the heart of performance issues in computing systems due to the use of certain hardware techniques to improve performance. Altering the access patterns to increase locality can dramatically increase performance of a given algorithm. Besides, repeated data access can be seen as redundancy in data movement. Similarly, there can also be redundancy in the repetition of calculations. This work also identifies some of the opportunities for avoiding these redundancies by directly reusing computation results. We document the possibilities of such reuse in some selected machine learning algorithms and give initial indicative results from our first experiments on data access improvement and algorithm redesign.

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

↑