DCLGNEMay 9, 2020

GPU Acceleration of Sparse Neural Networks

arXiv:2005.04347v11 citations
Originality Synthesis-oriented
AI Analysis

This work addresses the need for faster processing in machine learning strategies that generate sparse networks, such as pruning or evolutionary methods, but it is incremental as it applies existing GPU techniques to a specific network type.

The paper tackled the problem of accelerating sparse and arbitrary structured neural networks by using GPU parallelization, achieving significant speedup compared to sequential implementations.

In this paper, we use graphics processing units(GPU) to accelerate sparse and arbitrary structured neural networks. Sparse networks have nodes in the network that are not fully connected with nodes in preceding and following layers, and arbitrary structure neural networks have different number of nodes in each layers. Sparse Neural networks with arbitrary structures are generally created in the processes like neural network pruning and evolutionary machine learning strategies. We show that we can gain significant speedup for full activation of such neural networks using graphical processing units. We do a prepossessing step to determine dependency groups for all the nodes in a network, and use that information to guide the progression of activation in the neural network. Then we compute activation for each nodes in its own separate thread in the GPU, which allows for massive parallelization. We use CUDA framework to implement our approach and compare the results of sequential and GPU implementations. Our results show that the activation of sparse neural networks lends very well to GPU acceleration and can help speed up machine learning strategies which generate such networks or other processes that have similar structure.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes