Communication-Optimal Convolutional Neural Nets
By J. Demmel, Grace Dinh. 2018
22 citations recorded by the source corpus.
Efficiently executing convolutional neural nets (CNNs) is important in many machine-learning tasks. Since the cost of moving a word of data, either between levels of a memory hierarchy or between processors over a network, is much higher than the cost of an arithmetic operation, minimizing data movement is critical to performance optimization. In this paper, we present both new lower bounds on data movement needed for CNNs, and optimal sequential algorithms that attain these lower bounds. In most common cases, our optimal algorithms can attain significantly more data reuse than matrix multiplication.
Subfields: Artificial Intelligence, Computational Mechanics, Computer Vision and Pattern Recognition, Optimization & Training
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Ashish Vaswani
- Quoc V. Le
- Niki Parmar
- Noam Shazeer
- Jianfeng Gao
- Dustin Tran
- Irwan Bello
- Mohit Bansal
In Computational Mechanics
In Computer Vision and Pattern Recognition
- Luc Van Gool
- Noam Shazeer
- Quoc V. Le
- Dacheng Tao
- Yi Tay
- Andrew Zisserman
- Trevor Darrell
- Xiaogang Wang
In Optimization & Training
- HyoukJoong Lee
- Ashish Vaswani
- Blake A. Hechtman
- Noam Shazeer
- Peter G. Hawkins
- Mingsheng Hong
- Penporn Koanantakool
- Ryan Sepassi
Citations in the corpus
- Mesh-TensorFlow: Deep Learning for Supercomputers (2018, methodology): “5D [14] algorithm for matrices with different sparsities, best tile sizes for direct convolutions [17], etc.”