Papers › HarDNet: A Low Memory Traffic Network
HarDNet: A Low Memory Traffic Network
3 Sep 2019ICCV 2019 10arXiv:1909.00948archive 2025-07-28
Ping Chao, Chao-Yang Kao, Yu-Shan Ruan, Chien-Hsiang Huang, Youn-Long Lin
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.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="1909.00948", paper_2="…") with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="1909.00948")
Code
24 repositories listed; official and paper-mentioned ones first.
PingoLH/CenterNet-HarDNet
mentioned on GitHubpytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Objects as Points (arXiv:1904.07850; that paper's own run record: 77 ran (of which 0 constructed an object rather than computing a result; 66 with no instrument failure: 0 honoured, 0 violated, 66 with no contract checked; 11 where Syntology's instrument failed) · 53 unverified); nothing checks that they implement this paper's method. report
osmr/imgclsmob
mentioned on GitHubmxnetMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to ResNeSt: Split-Attention Networks (arXiv:2004.08955; that paper's own run record: 28 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 0 honoured, 0 violated, 21 with no contract checked; 7 where Syntology's instrument failed) · 20 unverified); nothing checks that they implement this paper's method. report
sithu31296/semantic-segmentation
mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to SegFormer: Simple and Efficient Design for Semantic Segmentation with Transformers (arXiv:2105.15203; that paper's own run record: 66 ran (of which 22 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 14 where Syntology's instrument failed) · 20 unverified), FaPN: Feature-aligned Pyramid Network for Dense Image Prediction (arXiv:2108.07058; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified) and A ConvNet for the 2020s (arXiv:2201.03545; that paper's own run record: 57 ran (of which 39 constructed an object rather than computing a result; 49 with no instrument failure: 2 honoured, 0 violated, 47 with no contract checked; 8 where Syntology's instrument failed) · 23 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PaddleDetection
paddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to PP-YOLOE: An evolved version of YOLO (arXiv:2203.16250; that paper's own run record: 22 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 2 honoured, 0 violated, 17 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified); nothing checks that they implement this paper's method. report
PaddlePaddle/PaddleSeg
paddleSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to EdgeFlow: Achieving Practical Interactive Segmentation with Edge-Guided Flow (arXiv:2109.09406; that paper's own run record: 5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified); nothing checks that they implement this paper's method. report
mindspore-ai/models
mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to AdaBin: Improving Binary Neural Networks with Adaptive Binary Sets (arXiv:2208.08084; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
ozora-ogino/efficient_backbones
pytorchMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to GhostNet: More Features from Cheap Operations (arXiv:1911.11907; that paper's own run record: 19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 3 honoured, 0 violated, 13 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified); nothing checks that they implement this paper's method. report
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections