Fast Algorithms for Convolutional Neural Networks

Citations Over TimeTop 1% of 2016 papers

Abstract

Deep convolutional neural networks take GPU-days of computation to train on large data sets. Pedestrian detection for self driving cars requires very low latency. Image recognition for mobile phones is constrained by limited processing resources. The success of convolutional neural networks in these situations is limited by how fast we can compute them. Conventional FFT based convolution is fast for large filters, but state of the art convolutional neural networks use small, 3 3 filters. We introduce a new class of fast algorithms for convolutional neural networks using Winograd's minimal filtering algorithms. The algorithms compute minimal complexity convolution over small tiles, which makes them fast with small filters and small batch sizes. We benchmark a GPU implementation of our algorithm with the VGG network and show state of the art throughput at batch sizes from 1 to 64.

Related Papers

• → FFT blitz(2021)9 cited
• → High-Performance FFT Algorithms(2019)1 cited
• → Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders(2002)1 cited
• Nonequivalent cascaded convolutional codes obtained from equivalent constituent convolutional encoders(1998)
• → Training FFT to Select Beams in Massive MIMO(2023)