Pith. sign in

REVIEW 2 cited by

How does topology influence gradient propagation and model performance of deep networks with DenseNet-type skip connections?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.00780 v3 pith:SF5SLGWI submitted 2019-10-02 stat.ML cs.CVcs.LG

classification stat.MLcs.CVcs.LG
keywords connectionsskipnn-massmobilenetsaccuracycifar-10concatenation-typedensenets
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

DenseNets introduce concatenation-type skip connections that achieve state-of-the-art accuracy in several computer vision tasks. In this paper, we reveal that the topology of the concatenation-type skip connections is closely related to the gradient propagation which, in turn, enables a predictable behavior of DNNs' test performance. To this end, we introduce a new metric called NN-Mass to quantify how effectively information flows through DNNs. Moreover, we empirically show that NN-Mass also works for other types of skip connections, e.g., for ResNets, Wide-ResNets (WRNs), and MobileNets, which contain addition-type skip connections (i.e., residuals or inverted residuals). As such, for both DenseNet-like CNNs and ResNets/WRNs/MobileNets, our theoretically grounded NN-Mass can identify models with similar accuracy, despite having significantly different size/compute requirements. Detailed experiments on both synthetic and real datasets (e.g., MNIST, CIFAR-10, CIFAR-100, ImageNet) provide extensive evidence for our insights. Finally, the closed-form equation of our NN-Mass enables us to design significantly compressed DenseNets (for CIFAR-10) and MobileNets (for ImageNet) directly at initialization without time-consuming training and/or searching.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On the Depth Scalability of Logic Gate Networks

    cs.LG 2026-07 conditional novelty 6.0 of 10

    An input-anchored topology in which every logic gate combines a private hidden spine with a direct input connection lets fixed-width logic gate networks keep improving with depth to 150 layers.

  2. No More Adam: Learning Rate Scaling at Initialization is All You Need

    cs.LG 2024-12 conditional novelty 5.0 of 10

    A fixed, per-group learning-rate scaling computed at initialization lets SGD with momentum match AdamW on several Transformer tasks while halving optimizer memory.

Pith tools