Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 177

The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.

Partial Order Pruning: For Best Speed/Accuracy Trade-Off in Neural Architecture Search

Open access
Li, Xin, Zhou, Yiming, Pan, Zheng, Feng, Jiashi · 2019 · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)

Abstract

Achieving good speed and accuracy trade-off on a target platform is very important in deploying deep neural networks in real world scenarios. However, most existing automatic architecture search approaches only concentrate on high performance. In this work, we propose an algorithm that can offer better speed/accuracy trade-off of searched networks, which is termed "Partial Order Pruning''. It prunes the architecture search space with a partial order assumption to automatically search for the architectures with the best speed and accuracy trade-off. Our algorithm explicitly takes profile information about the inference speed on the target platform into consideration. With the proposed algorithm, we present several Dongfeng (DF) networks that provide high accuracy and fast inference speed on various application GPU platforms. By further searching decoder architectures, our DF-Seg real-time segmentation networks yield state-of-the-art speed/accuracy trade-off on both the {target embedded device} and the high-end GPU.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cvpr.2019.00936

Cites

18 of 18 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 18 references

Research works printed but not linked: 21

  1. 10.1109/CVPR.2018.00716 · DOI · Paper page
  2. yang, 2018, Netadapt: Platform-aware neural network adaptation for mobile applications, ECCV
  3. 10.1109/CVPR.2018.00907 · DOI · Paper page
  4. 10.1109/CVPR.2017.660 · DOI · Paper page
  5. guo, 2016, Dynamic network surgery for efficient dnns, NIPS
  6. ioffe, 2015, Batch normalization: Accelerating deep network training by reducing internal covariate shift, ICML
  7. 10.1109/CVPR.2016.435 · DOI · Paper page
  8. liu, 2015, Sparse convolutional neural networks, CVPR
  9. liu, 2018, Progressive neural architecture search, ECCV
  10. 10.1109/CVPR.2019.01099 · DOI · Paper page
  11. 10.1109/TPAMI.2017.2699184 · DOI · Paper page
  12. wang, 2018, Pelee: A real-time object detection system on mobile devices, NIPS
  13. chen, 2018, Searching for efficient multi-scale architectures for dense image prediction, NIPS
  14. 10.1109/CVPR.2016.521 · DOI · Paper page
  15. dong, 2018, Dpp-net: Device-aware progressive search for paretooptimal neural architectures, ECCV
  16. cai, 2019, ProxylessNAS: Direct neural architecture search on target task and hardware, ICLRE
  17. dong, 2019, Searching for a robust neural architecture in four gpu hours, CVPR
  18. mehta, 2018, Espnet: Efficient spatial pyramid of dilated convolutions for semantic segmentation, ECCV
  19. real, 2017, Large-scale evolution of image classifiers, ICML
  20. 10.1109/CVPR.2015.7298594 · DOI · Paper page
  21. sandler, 2018, Inverted residuals and linear bottlenecks: Mobile networks for classification, detection and segmentation, CVPR

Cited by

Metadata

Authors
Li, X., Zhou, Y., Pan, Z., & Feng, J.
Venue
2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
Publisher
IEEE
Published
2019-06
Pages
9137-9145
ISSN
1063-6919 (ISSN-L)
OpenAlex
W2921495890
Cited by
177
References
18
FWCI
7.25
Type
conference paper
Language
en
Open access
green

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

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.