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

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

Convolutional Networks with Dense Connectivity

Open access
Huang, Gao, Liu, Zhuang, Pleiss, Geoff, Maaten, Laurens van der, Weinberger, Kilian Q.·2022·IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

Recent work has shown that convolutional networks can be substantially deeper, more accurate, and efficient to train if they contain shorter connections between layers close to the input and those close to the output. In this paper, we embrace this observation and introduce the Dense Convolutional Network (DenseNet), which connects each layer to every other layer in a feed-forward fashion. Whereas traditional convolutional networks with L layers have L connections-one between each layer and its subsequent layer-our network has [Formula: see text] direct connections. For each layer, the feature-maps of all preceding layers are used as inputs, and its own feature-maps are used as inputs into all subsequent layers. DenseNets have several compelling advantages: they alleviate the vanishing-gradient problem, encourage feature reuse and substantially improve parameter efficiency. We evaluate our proposed architecture on four highly competitive object recognition benchmark tasks (CIFAR-10, CIFAR-100, SVHN, and ImageNet). DenseNets obtain significant improvements over the state-of-the-art on most of them, whilst requiring less parameters and computation to achieve high performance.

Overview

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1109/tpami.2019.2918284

Cites

20 of 20 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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 20 references

Research works printed but not linked: 30

  1. netzer, 2011, Reading digits in natural images with unsupervised feature learning, Proc NIPS Workshop Deep Learn Unsupervised Feature Learn
  2. 10.1109/CVPR.2018.00291 · DOI · Paper page
  3. krizhevsky, 2009, Learning multiple layers of features from tiny images, Tech Rep
  4. chen, 2016, Training deep nets with sublinear memory cost, CoRR, abs 1604 6174
  5. liao, 2016, Bridging the gaps between residual learning, recurrent neural networks and visual cortex, CoRR, abs 1604 3640
  6. goodfellow, 2013, Maxout networks, Proc 30th Int Conf Mach Learn, iii-1319
  7. lee, 2015, Deeply-supervised nets, Proc 18th Int Conf Artif Intell Statistics, 562
  8. fahlman, 1989, The cascade-correlation learning architecture, Proc Advances in Neural Inf Process Syst, 524
  9. 10.1109/TNN.2010.2073482 · DOI · Paper page
  10. 10.1109/CVPR.2013.465 · DOI · Paper page
  11. 10.1109/ICCV.2015.144 · DOI · Paper page
  12. cortes, 2017, Adanet: Adaptive structural learning of artificial neural networks, Proc 34rd Int Conf Mach Learn, 874
  13. 10.1109/CVPR.2015.7298594 · DOI · Paper page
  14. 10.1109/CVPRW.2017.156 · DOI · Paper page
  15. srivastava, 2015, Training very deep networks, Proc 28th Int Conf Neural Inf Process Syst, 2377
  16. chen, 2017, Dual path networks, Proc 31st Int Conf Neural Inf Process Syst, 4470
  17. glorot, 2011, Deep sparse rectifier neural networks, Proc 14th Int Conf Artif Intell Statistics, 315
  18. li, 2017, H-denseunet: Hybrid densely connected unet for liver and liver tumor segmentation from ct volumes, CoRR, abs 1709 7330
  19. 10.1007/978-3-319-46493-0_39 · DOI · Paper page
  20. larsson, 0, Fractalnet: Ultra-deep neural networks without residuals, CoRR, abs 1605 7648
  21. srivastava, 2014, Dropout: A simple way to prevent neural networks from overfitting, J Mach Learning Res, 15, 1929
  22. iandola, 2016, Squeezenet: Alexnet-level accuracy with 50x fewer parameters and < 0.5 MB model size, CoRR, abs 1602 7360
  23. hu, 2017, Log-densenet: How to sparsify a densenet, CoRR, abs 1711 2
  24. targ, 2016, Resnet in resnet: Generalizing residual architectures, CoRR, abs 1603 8029
  25. rasmus, 2015, Semi-supervised learning with ladder networks, Proc 28th Int Conf Neural Inf Process Syst, 3546
  26. sermanet, 2012, Convolutional neural networks applied to house numbers digit classification, Proc 21st Int Conf Pattern Recognit, 3288
  27. lin, 0, Network in network, CoRR, abs 1312 4400
  28. sutskever, 2013, On the importance of initialization and momentum in deep learning, Proc 30th Int Conf Int Conf Mach Learn, iii-1139
  29. wang, 2016, Deeply-fused nets, CoRR, abs 1605 7716
  30. pezeshki, 2016, Deconstructing the ladder network architecture, Proc 33rd Int Conf Mach Learn, 2368

Cited by

See all 591

Metadata

Authors
Huang, G., Liu, Z., Pleiss, G., Maaten, L. V. D., & Weinberger, K. Q.
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2022-12-01
Volume
44
Issue
12
Pages
8704-8716
ISSN
  • 0162-8828 (ISSN-L)
  • 2160-9292
  • 1939-3539
OpenAlex
W2945472816
Cited by
591
References
20
FWCI
23.24
Type
journal article
Language
en
Open access
green
Funders
  • National Science Foundation (III-1618134, III-1526012, IIS-1149882, IIS-1724282)
  • Office of Naval Research (N00014-17-1-2175)
  • Bill and Melinda Gates Foundation
  • SAP North America
  • NSF TRIPODS (#1740822)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Convolutional Networks with Dense Connectivity. https://app.cochat.ai/papers/10.1109/tpami.2019.2918284
The paper
Huang, G., Liu, Z., Pleiss, G., Maaten, L. V. D., & Weinberger, K. Q. (2022). Convolutional Networks with Dense Connectivity. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2019.2918284

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.