Sparse Deep Neural Network Graph Challenge

• Published in: arXiv.org 2019-09
• Main Authors: Kepner, Jeremy, Alford, Simon, Gadepally, Vijay, Jones, Michael, Milechin, Lauren, Robinett, Ryan, Samsi, Sid
• Format: Article
• Language: English
• Subjects: Analytics; Computation; Handwriting; Hardware; Inference; Machine learning; Neural networks; Programming environments
• ISSN: 2331-8422
• DOI: 10.48550/arxiv.1909.05631

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 proposed 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. Sparse DNN inference is amenable to both vertex-centric implementations and array-based implementations (e.g., using the GraphBLAS.org standard). The computations are simple enough that performance predictions can be made based on simple computing hardware models. The input data sets are derived from the MNIST handwritten letters. The surrounding I/O and verification provide the context for each sparse DNN inference that allows rigorous definition of both the input and the output. Furthermore, since the proposed sparse DNN challenge is scalable in both problem size and hardware, it can be used to measure and quantitatively compare a wide range of present day and future systems. Reference implementations have been implemented and their serial and parallel performance have been measured. Specifications, data, and software are publicly available at GraphChallenge.org