Cited by 27Advanced Neural Network ApplicationsParallel Computing and Optimization TechniquesComputer Science and Engineering

Diagonalwise Refactorization: An Efficient Training Method for Depthwise Convolutions

Open access
Qin, Zheng, Zhang, Zhaoning, Li, Dongsheng, Zhang, Yiming, Peng, Yuxing·2018·2018 International Joint Conference on Neural Networks (IJCNN)

Abstract

Depthwise convolutions provide significant performance benefits owing to the reduction in both parameters and mult-adds. However, training depthwise convolution layers with GPUs is slow in current deep learning frameworks because their implementations cannot fully utilize the GPU capacity. To address this problem, in this paper we present an efficient method (called diagonalwise refactorization) for accelerating the training of depthwise convolution layers. Our key idea is to rearrange the weight vectors of a depthwise convolution into a large diagonal weight matrix so as to convert the depthwise convolution into one single standard convolution, which is well supported by the cuDNN library that is highly-optimized for GPU computations. We have implemented our training method in five popular deep learning frameworks. Evaluation results show that our proposed method gains 15.4× training speedup on Darknet, 8.4× on Caffe, 5.4× on PyTorch, 3.5× on MXNet, and 1.4× on TensorFlow, compared to their original implementations of depthwise convolutions.

Integrity signals

Registry

Crossref · 10.1109/ijcnn.2018.8489312

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Qin et al. (2018) show that Depthwise 3x3 Convolutions comprised just 3.06% of an example network's Multiply-Add operations, while utilizing 82.86% of the total training time in the FPO-efficient MobileNet architecture.

    “Similarly, Qin et al. (2018) show how Depthwise 3x3 Convolutions comprised just 3.06% of an example network's Multiply-Add operations, while utilizing 82.86% of the total training time in the FPO-efficient MobileNet architecture Howard et al. (2017).”

Cites

Flagged first, then by citations

6 of the 37 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Qin, Z., Zhang, Z., Li, D., Zhang, Y., & Peng, Y.
Affiliations
National University of Defense Technology (CN)
Venue
2018 International Joint Conference on Neural Networks (IJCNN)
Publisher
IEEE
Published
2018-07
Pages
1-8
ISSN
2161-4407 (ISSN-L)
OpenAlex
W2963404959
Cited by
27
References
37
Citations by year
2026: 1 · 2024: 6 · 2023: 5 · 2022: 4 · 2021: 3 · 2020: 5 · 2019: 3
FWCI
0.83
Type
conference paper
Language
en
Open access
Locations
  • International Joint Conference on Neural Networks (IJCNN) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Major State Basic Research Development Program of China
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
Keywords
depthwise convolution, training acceleration, GPU acceleration, cuDNN, dark web, Caffe, PyTorch, MXNet, TensorFlow

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review