Related: a few years ago, various people were exploring locality sensitive hashing as an alternative to neural networks(SLIDE : In Defense of Smart Algorithms over Hardware Acceleration for Large-Scale Deep Learning Systems [1]). This never took off. I don't if it didn't work or it was a matter of the "bitter lesson" ideology pushing people to prefer hardware acceleration over smart algorithms. I would note that smart algorithms require hiring (more)smart people and not only can hardware acceleration be cheaper but hardware and data can be more reliably added than smart people, who are short supply. [1]: https://arxiv.org/abs/1903.03129
SLIDE : In Defense of Smart Algorithms over Hardware Acceleration for Large-Scale Deep Learning Systems
Beidi Chen, Tharun Medini, James Farwell
Show all 6 authors
Sameh Gobriel, Charlie Tai, Anshumali Shrivastava
2019 · arXiv
- HN score
- 0
- Mentions
- 7
- Readers
- 6
- Months
- 6
From the abstract
Deep Learning (DL) algorithms are the central focus of modern machine learning systems. As data volumes keep growing, it has become customary to train large neural networks with hundreds of millions of parameters to maintain enough capacity to memorize these volumes and obtain state-of-the-art accuracy. To get around the costly computations associated with large models and data, the community is increasingly investing in specialized hardware for model training. However, specialized hardware is expensive and hard to generalize to a multitude of tasks. The progress on the algorithmic front has failed to demonstrate a direct advantage over powerful hardware such as NVIDIA-V100 GPUs. This paper provides an exception. We propose SLIDE (Sub-LInear Deep learning Engine) that uniquely blends smart randomized algorithms, with multi-core parallelism and workload optimization. Using just a CPU, SLIDE drastically reduces the computations during both training and inference outperforming an optimized implementation of Tensorflow (TF) on the best available GPU. Our evaluations on industry-scale recommendation datasets, with large fully connected architectures, show that training with SLIDE on a 44 core CPU is more than 3.5 times (1 hour vs. 3.5 hours) faster than the same network trained using TF on Tesla V100 at any given accuracy level. On the same CPU hardware, SLIDE is over 10x faster than TF. We provide codes and scripts for reproducibility.
Metadata: arXiv. Abstracts retain their original authors’ rights.
In the conversation
Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels
7 selected excerpts · 7 total mentions
> Sparse operations still don’t have good support in any of the generic SIMD instructions (avx2/512, Neon), or in GPU… This is incorrect. For GPUs: Nvidia A100 (launched in 2020) has sparse matrix multiplication support for inference. For CPUs: Check out SLIDE from 2019: https://arxiv.org/pdf/1903.03129.pdf
It's not the first similar claim, there was one that large CPU's can beat GPUs by creating a very sparse matrix using spatial hashing. Preserving the gradient but finding it with vastly less computation by simply not multiplying elements that don't have much or any impact. EDIT: orginial work afaik https://arxiv.org/abs/1903.03129
Paper: https://arxiv.org/abs/1903.03129 Code: https://github.com/keroro824/HashingDeepLearning Edit: Here is the new paper referred to https://arxiv.org/abs/2103.10891 Here is the new code: https://github.com/RUSH-LAB/SLIDE The paper I linked above was the first paper of which this is supposed to be an improvement.
I found it very weird that the SLIDE algorithm from early 2019 isn’t mentioned. Maybe I missed it or maybe it is compared just deeper in the referenced publications? SLIDE seems way, way superior to any of the listed solutions or approaches, as far as I could tell on a first read through. https://arxiv.org/abs/1903.03129
No idea, it was probably sponsored by them but the concept should be the same for AMD and others too. EDIT: here's a bit more context (they've been contacted by Intel after publishing initial PoC) source: https://news.rice.edu/2020/03/02/deep-learning-rethink-overc... paper: https://arxiv.org/pdf/1903.03129.pdf repo: https://github.com/keroro824/HashingDeepLearning
Sparse neural networks can be optimized by implementing them using Locality Sensitive Hashing (2019 paper): https://arxiv.org/pdf/1903.03129.pdf Fun fact, last week one of the main authors of the above 2019 paper spun off a company for the above approach: https://techcrunch.com/2021/08/13/thirdai-raises-6m-to-democ...
Keep following the thread.
More in Machine learningMore from the same topics.
Language Models are Few-Shot Learners
Tom B. Brown, Benjamin Mann, Nick Ryder +28
Recent work has demonstrated substantial gains on many NLP tasks and benchmarks by pre-training on a large corpus of text followed by fine-tuning on a specific task.
Dissolving the Fermi Paradox
Anders Sandberg, Eric Drexler, Toby Ord
The Fermi paradox is the conflict between an expectation of a high {\em ex ante} probability of intelligent life elsewhere in the universe and the apparently lifeless universe we in fact observe.
Understanding deep learning requires rethinking generalization
Chiyuan Zhang, Samy Bengio, Moritz Hardt +2
Despite their massive size, successful deep artificial neural networks can exhibit a remarkably small difference between training and test performance.
Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecode
Haoran Xu, Fredrik Kjolstad
Fast compilation is important when compilation occurs at runtime, such as query compilers in modern database systems and WebAssembly virtual machines in modern browsers.