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

The DOI matches its Crossref record; 45 of the 45 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.

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/tpami.2019.2918284

Cites

45 of 45 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: 5

  1. goodfellow, 2013, Maxout networks, Proc 30th Int Conf Mach Learn, iii-1319
  2. chen, 2017, Dual path networks, Proc 31st Int Conf Neural Inf Process Syst, 4470
  3. rasmus, 2015, Semi-supervised learning with ladder networks, Proc 28th Int Conf Neural Inf Process Syst, 3546
  4. lin, 0, Network in network, CoRR, abs 1312 4400
  5. wang, 2016, Deeply-fused nets, CoRR, abs 1605 7716

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
45
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

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.