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

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

Pruning and quantization for deep neural network acceleration: A survey

Open access
Liang, Tailin, Glossner, John, Wang, Lei, Shi, Shaobo, Zhang, Xiaotong · 2021 · Neurocomputing

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.1016/j.neucom.2021.07.045

Cites

246 of 246 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

Research works printed but not linked: 16

  1. Baskin, C., Schwartz, E., Zheltonozhskii, E., Liss, N., Giryes, R., Bronstein, A.M., Mendelson, A., 2018. UNIQ: Uniform Noise Injection for Non-Uniform Quantization of Neural Networks. arXiv preprint arXiv:1804.10969 http://arxiv.org/abs/1804.10969. · arXiv
  2. Chellapilla, K., Puri, S., Simard, P., 2006. High Performance Convolutional Neural Networks for Document Processing, in: Tenth International Workshop on Frontiers in Handwriting Recognition. https://hal.inria.fr/inria-00112631/, 10.1.1.137.482.
  3. Choi, 2008, Solving local minima problem with large number of hidden nodes on two-layered feed-forward artificial neural networks, Neurocomputing, 71, 3640, 10.1016/j.neucom.2008.04.004 · doi:10.1016/j.neucom.2008.04.004
  4. Cotofana, S., Vassiliadis, S., Logic, T., Addition, B., Addition, S., 1997. Low Weight and Fan-In Neural Networks for Basic Arithmetic Operations, in: 15th IMACS World Congress, pp. 227–232. 10.1.1.50.4450.
  5. Courbariaux, M., Bengio, Y., David, J.P., 2015. BinaryConnect: Training Deep Neural Networks with binary weights during propagations, in: Advances in Neural Information Processing Systems (NIPS), pp. 1–9. http://arxiv.org/abs/1511.00363, DOI: 10.5555/2969442.2969588. · arXiv · doi:10.5555/2969442.2969588
  6. Lei, J., Gao, X., Song, J., Wang, X.L., Song, M.L., 2018. Survey of Deep Neural Network Model Compression. Ruan Jian Xue Bao/Journal of Software 29, 251–266. https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049464636&doi=10.13328 10.13328/j.cnki.jos.005428. · doi:10.13328/j.cnki.jos.005428
  7. Li, M., Liu, Y.I., Liu, X., Sun, Q., You, X.I.N., Yang, H., Luan, Z., Gan, L., Yang, G., Qian, D., 2020a. The Deep Learning Compiler: A Comprehensive Survey. ArXiv preprint 1, 1–36. http://arxiv.org/abs/2002.03794. · arXiv
  8. Macchi, 1975, Coincidence Approach To Stochastic Point Process, Adv. Appl. Prob., 7, 83, 10.2307/1425855 · doi:10.2307/1425855
  9. Migacz, 2017, 8-bit inference with TensorRT, GPU Technology Conference, 2, 7
  10. Ouyang, J., Noh, M., Wang, Y., Qi, W., Ma, Y., Gu, C., Kim, S., Hong, K.i., Bae, W.K., Zhao, Z., Wang, J., Wu, P., Gong, X., Shi, J., Zhu, H., Du, X., 2020. Baidu Kunlun An AI processor for diversified workloads, in: 2020 IEEE Hot Chips 32 Symposium (HCS), IEEE. pp. 1–18. https://ieeexplore.ieee.org/document/9220641/, DOI: 10.1109/HCS49909.2020.9220641. · doi:10.1109/hcs49909.2020.9220641
  11. Rodriguez, 2018, Lower Numerical Precision Deep Learning Inference and Training, Intel White Paper, 1
  12. Ruffy, F., Chahal, K., 2019. The State of Knowledge Distillation for Classification. ArXiv preprint http://arxiv.org/abs/1912.10850. · arXiv
  13. Saad, 1990, Training Feed Forward Nets with Binary Weights Via a Modified CHIR Algorithm, Complex Systems, 4, 573
  14. Sabour, 2017, Dynamic routing between capsules, Advances in Neural Information Processing Systems (NIPS), 3857
  15. Singh, P., Kumar Verma, V., Rai, P., Namboodiri, V.P., 2019. Play and Prune: Adaptive Filter Pruning for Deep Model Compression, in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, California. pp. 3460–3466. https://www.ijcai.org/proceedings/2019/480, 10.24963/ijcai.2019/480. · DOI
  16. Inc, 2018, Accelerating DNNs with Xilinx Alveo Accelerator Cards (WP504), White Paper, 504, 1

Cited by

See all 943

Metadata

Authors
Liang, T., Glossner, J., Wang, L., Shi, S., & Zhang, X.
Venue
Neurocomputing
Publisher
Elsevier BV
Published
2021-10
Volume
461
Pages
370-403
ISSN
0925-2312 (ISSN-L)
OpenAlex
W3184606595
Cited by
943
References
246
FWCI
49.47
Type
journal article
Language
en
Open access
green
Funders
National Natural Science Foundation of China

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.