HarDNet: A Low Memory Traffic Network

Ping Chao, Chao-Yang Kao, Yu-Shan Ruan, Chien-Hsiang Huang, Youn-Long Lin
9/3/2019
cs.CV

Official code: PingoLH/Pytorch-HarDNet (374 stars, MIT, last commit 2021-05-13).

Abstract

State-of-the-art neural network architectures such as ResNet, MobileNet, and DenseNet have achieved outstanding accuracy over low MACs and small model size counterparts. However, these metrics might not be accurate for predicting the inference time. We suggest that memory traffic for accessing intermediate feature maps can be a factor dominating the inference latency, especially in such tasks as real-time object detection and semantic segmentation of high-resolution video. We propose a Harmonic Densely Connected Network to achieve high efficiency in terms of both low MACs and memory traffic. The new network achieves 35%, 36%, 30%, 32%, and 45% inference time reduction compared with FC-DenseNet-103, DenseNet-264, ResNet-50, ResNet-152, and SSD-VGG, respectively. We use tools including Nvidia profiler and ARM Scale-Sim to measure the memory traffic and verify that the inference latency is indeed proportional to the memory traffic consumption and the proposed network consumes low memory traffic. We conclude that one should take memory traffic into consideration when designing neural network architectures for high-resolution applications at the edge.

View on arXivView PDF

Code Implementations(1)

MIT

35% faster than ResNet: Harmonic DenseNet, A low memory traffic network

37464PythonSep 2, 20195 years agoMIT
denseneticcv2019imagenetobject-detectionsemantic-segmentation

Similar Papers

Cite this paper

@article{chao2019hardnet,
  title  = {HarDNet: A Low Memory Traffic Network},
  author = {Ping Chao and Chao-Yang Kao and Yu-Shan Ruan and Chien-Hsiang Huang and Youn-Long Lin},
  year   = {2019},
  eprint = {1909.00948},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1909.00948}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1909.00948.svg)](https://codeofpaper.com/paper/1909.00948)

Discussion