Name
Abstract | ||
|---|---|---|
The DenseNet architecture is highly computationally efficient as a result of feature reuse. However, a naive DenseNet implementation can require a significant amount of GPU memory: If not properly managed, pre-activation batch normalization and contiguous convolution operations can produce feature maps that grow quadratically with network depth. In this technical report, we introduce strategies to reduce the memory consumption of DenseNets during training. By strategically using shared memory allocations, we reduce the memory cost for storing feature maps from quadratic to linear. Without the GPU memory bottleneck, it is now possible to train extremely deep DenseNets. Networks with 14M parameters can be trained on a single GPU, up from 4M. A 264-layer DenseNet (73M parameters), which previously would have been infeasible to train, can now be trained on a single workstation with 8 NVIDIA Tesla M40 GPUs. On the ImageNet ILSVRC classification dataset, this large DenseNet obtains a state-of-the-art single-crop top-1 error of 20.26%. |
Year | Venue | Field |
|---|---|---|
2017 | arXiv: Computer Vision and Pattern Recognition | Bottleneck,Normalization (statistics),Shared memory,CUDA,Computer science,Reuse,Convolution,Parallel computing,Workstation,Artificial intelligence,Deep learning,Machine learning |
DocType | Volume | Citations |
Journal | abs/1707.06990 | 9 |
PageRank | References | Authors |
0.53 | 10 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoff Pleiss | 1 | 188 | 9.52 |
| Danlu Chen | 2 | 39 | 2.14 |
| Gao Huang | 3 | 875 | 53.36 |
| Tongcheng Li | 4 | 9 | 0.53 |
| van der maaten | 5 | 763 | 48.75 |
| Kilian Q. Weinberger | 6 | 4072 | 227.22 |