Pith. sign in

REVIEW 4 cited by

Residual Networks Behave Like Ensembles of Relatively Shallow Networks

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 1605.06431 v2 pith:AEE5HK2Y submitted 2016-05-20 cs.CV cs.AIcs.LGcs.NE

classification cs.CVcs.AIcs.LGcs.NE
keywords networkspathsresidualdeepgradientonlyshorttraining
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work we propose a novel interpretation of residual networks showing that they can be seen as a collection of many paths of differing length. Moreover, residual networks seem to enable very deep networks by leveraging only the short paths during training. To support this observation, we rewrite residual networks as an explicit collection of paths. Unlike traditional models, paths through residual networks vary in length. Further, a lesion study reveals that these paths show ensemble-like behavior in the sense that they do not strongly depend on each other. Finally, and most surprising, most paths are shorter than one might expect, and only the short paths are needed during training, as longer paths do not contribute any gradient. For example, most of the gradient in a residual network with 110 layers comes from paths that are only 10-34 layers deep. Our results reveal one of the key characteristics that seem to enable the training of very deep networks: Residual networks avoid the vanishing gradient problem by introducing short paths which can carry gradient throughout the extent of very deep networks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Scaling Laws for Neural Language Models

    cs.LG 2020-01 unverdicted novelty 8.0 of 10

    Empirical power-law scaling governs language model loss versus model size, data size, and compute, enabling optimal allocation of training compute.

  2. Greedy dynamical meta-learning

    cs.LG 2026-07 reject novelty 6.0 of 10

    A proposed meta-learning framework trains stochastic dynamical systems by evolutionary selection over mutant trajectories, reducing the tuning burden to two timescales, µ and τ.

  3. CascadeFormer: Depth-Tapered Transformers Motivated by Gradient Fan-in Asymmetry

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    CascadeFormer tapers Transformer width with depth based on gradient fan-in asymmetry to match uniform baselines in perplexity while cutting latency 8.6%.

  4. Manifold-Constrained Hyper-Connections for Parameter-Efficient Finetuning

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Applying mHC as a PEFT method shows that learned residual mixing is unnecessary — even harmful — in finetuning, and mHC+LoRA combinations give small task-dependent gains.

Pith tools