*By Beidi Chen, Tharun Medini, and Anshumali Shrivastava ( Rice University); James Farwell, Sameh Gobriel, and Charlie Tai (Intel), 2020*

This paper suggests a new algorithm for training deep neural networks that can be run efficiently without a GPU.

## What can we learn from this paper?

That increasing the performance of dedicated hardware (such as GPUs) is not the only way to speed up training and inference of large neural networks.

## Prerequisites (to understand the paper, what does one need to be familiar with?)

- Deep neural networks
- Hash functions and sparse networks, for those who want to understand the details of the algorithm

## Motivation

To find alternatives to hardware acceleration in terms of improving deep neural network time performance.

## Results

In this article the authors use the ideas, previously developed by themselves and other researchers, of __adaptive dropouts__ and __locality sensitive hash tables__ (LSH). The main point of the strategy is to selectively drop out the majority of neurons in the network during every training step, thus greatly reducing the number of calculations. The neurons that are chosen to be active at each training step are picked among the ones with the largest activations, and using LSH allows this step to be performed efficiently. For those interested in the details of this process, I recommend reading the __LSH paper__.

The sparsity of the resulting network allows for asynchronous parallelization, since conflicts between updates are unlikely, thus giving superior performance on systems with many CPU cores as compared to standard TensorFlow-based training.

The authors discuss various tweaks that can be used to improve the performance of the suggested algorithm and evaluate the performance against Tensorflow on both GPU and CPU systems. The two large datasets used for evaluation were Delicious-200K (bookmarks) and Amazon-670K (product to product recommendations) from the __Extreme Classification Repository__.

For both datasets, the same fully-connected network with more than 100 million parameters was used. All three methods achieved nearly identical performance on the validation set. However, the new SLIDE approach was about twice as fast to train as TF-GPU and almost an order of magnitude faster than TF-CPU.

Since the authors only consider a fully-connected network, it is not clear from the paper if other, currently more popular architectures (e.g. convolutional networks) can be made more efficient using a similar approach. If the suggested technique is expanded to arbitrary network structures, it would be an important step in making modern deep learning more efficient.

## Original paper link

## Further reading

*Scalable and Sustainable Deep Learning via Randomized Hashing* by R. Spring and A. Shrivastava, 2017

*Adaptive Sampled Softmax with Kernel Based Sampling* by G. Blanc and S. Rendle, 2018