Name
Abstract | ||
|---|---|---|
Winograd-based convolution has quickly gained traction as a preferred approach to implement convolutional neural networks (ConvNet) on various hardware platforms because it could require fewer floating point operations than FFT-based or direct convolutions.
In this paper, we analyze the theoretical performances of three methods (regular FFT-, Gauss-FFT-, and Winograd-based convolutions), as well as compare their highly optimized implementations on modern multi- and many-core CPUs. With all three implementations employing the same optimizations on modern CPUs, our experimental results with modern ConvNets show that the FFT-based implementations generally outperform the Winograd-based approach, which is contrary to the popular belief.
To understand the results, we use a Roofline performance model to analyze the three implementations in detail, by looking at each of their computation phases and by considering not only the number of floating point operations, but also the memory bandwidth and the cache sizes. The performance analysis explains why, and under what conditions, the FFT-based implementations outperform the Winograd-based one, on modern CPUs.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3330345.3330382 | Proceedings of the ACM International Conference on Supercomputing |
Field | DocType | ISBN |
Convolution,Computer science,Parallel computing,Fast Fourier transform | Conference | 978-1-4503-6079-1 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| aleksandar zlateski | 1 | 39 | 5.65 |
| Zhen Jia | 2 | 133 | 9.84 |
| Kai Li | 3 | 5345 | 435.41 |
| Frédo Durand | 4 | 8625 | 414.94 |