Sparse Deep Neural Network Graph Challenge
Jeremy Kepner, Simon Alford, Vijay Gadepally, Michael Jones, Lauren, Milechin, Ryan Robinett, Sid Samsi

TL;DR
The paper introduces a scalable Sparse Deep Neural Network (DNN) inference challenge based on well-defined computations and real datasets, aimed at benchmarking and advancing sparse AI systems across diverse hardware.
Contribution
It presents a new scalable sparse DNN inference challenge with standardized specifications, enabling performance measurement and comparison of current and future AI hardware systems.
Findings
Reference implementations demonstrate measurable serial and parallel performance.
The challenge is scalable in problem size and hardware.
It provides a rigorous framework for benchmarking sparse DNN inference.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
