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

GraphChallenge .org稀疏深度神经网络性能

GraphChallenge.org Sparse Deep Neural Network Performance

MIT Lincoln Laboratory Supercomputing Center(麻省理工学院林肯实验室超级计算中心);MIT Computer Science & AI Laboratory(麻省理工学院计算机科学与人工智能实验室);MIT Mathematics Department(麻省理工学院数学系);MIT Dept. of Earth, Atmospheric, & Planetary Sciences(麻省理工学院地球、大气与行星科学系)

Jeremy Kepner, Simon Alford, Vijay Gadepally, Michael Jones, Lauren Milechin, Albert Reuther, Ryan Robinett, Sid Samsi

摘要:

MIT/IEEE/Amazon GraphChallenge.org鼓励社区开发新的解决方案来分析图形和稀疏数据。稀疏AI分析带来了独特的可扩展性困难。稀疏深度神经网络(DNN)挑战赛借鉴了机器学习、高性能计算和视觉分析等方面的挑战,创造了一个反映新兴稀疏人工智能系统的挑战。稀疏DNN挑战基于数学上定义良好的DNN推理计算,可以在任何编程环境中实现。在2019年,我们收到了来自广泛作者和组织的几个稀疏DNN挑战提交。本文介绍了这些提交的最佳性能的性能分析。这些提交表明,他们最先进的稀疏DNN执行时间$T_{\rm DNN}$是执行的DNN操作数量$N_{\rm op}$的强函数。稀疏DNN挑战提供了当前稀疏DNN系统的清晰画面,并强调了在非常大的稀疏DNN上实现高性能的新创新的必要性。

英文摘要:

The MIT/IEEE/Amazon GraphChallenge.org encourages community approaches to developing new solutions for analyzing graphs and sparse data. Sparse AI analytics present unique scalability difficulties. The Sparse Deep Neural Network (DNN) Challenge draws upon prior challenges from machine learning, high performance computing, and visual analytics to create a challenge that is reflective of emerging sparse AI systems. The sparse DNN challenge is based on a mathematically well-defined DNN inference computation and can be implemented in any programming environment. In 2019 several sparse DNN challenge submissions were received from a wide range of authors and organizations. This paper presents a performance analysis of the best performers of these submissions. These submissions show that their state-of-the-art sparse DNN execution time, $T_{\rm DNN}$, is a strong function of the number of DNN operations performed, $N_{\rm op}$. The sparse DNN challenge provides a clear picture of current sparse DNN systems and underscores the need for new innovations to achieve high performance on very large sparse DNNs.

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

↑