AIAny

Deep Residual Learning for Image Recognition

Before residual connections, stacking more layers made networks worse, not better — this 2015 paper fixed that by having layers learn a residual F(x)=H(x)-x via shortcut connections, enabling 152-layer nets that won ILSVRC 2015.

Introduction

The counterintuitive problem this paper named was not vanishing gradients but degradation: adding layers to an already-deep network made training error go up, even though a deeper net can in principle just copy the shallower one. That observation reframes the whole contribution. The fix is almost embarrassingly simple — let each block learn the residual F(x) = H(x) - x and add the input back through a shortcut — but it turned "depth" from a liability into the main lever for accuracy.

Key Findings
  • Degradation, not overfitting, was the wall. Plain deep nets had higher training error than shallower ones; residual reformulation removed that ceiling, so accuracy now climbed with depth instead of collapsing.
  • Identity shortcuts cost nothing. The skip connection adds no parameters and negligible compute, yet makes optimization dramatically easier — a 152-layer ResNet is 8x deeper than VGG while having lower complexity.
  • The numbers held up. An ensemble reached 3.57% top-5 error on ImageNet, winning ILSVRC 2015, and the same backbone drove a 28% relative gain on COCO detection.
  • Depth as a transferable feature. Because representations got deeper and trainable, ResNet became the default backbone far beyond classification — detection, segmentation, and eventually non-vision tasks.
How It Works

A residual block computes y = F(x) + x, so the layers only need to model the difference from the input. When the optimal mapping is close to identity, driving F toward zero is far easier than fitting an unreferenced function from scratch — which is precisely the regime very deep stacks fall into.

Who It Fits / When to Skip

Great fit if you want the origin of skip connections — the idea now baked into Transformers, U-Nets, and almost every deep architecture — or to understand why depth stopped being dangerous. Look elsewhere if you need a current vision recipe: attention-based backbones (ViT) and modern training tricks came later, and this paper is the structural foundation, not a leaderboard result.

Information

  • Websitear5iv.labs.arxiv.org
  • OrganizationsMicrosoft Research
  • AuthorsKaiming He, Xiangyu Zhang, Shaoqing Ren, Jian Sun
  • Published date2015/12/10

More Items

Performs native structural reasoning for proteins, small molecules and inorganic crystals by tokenizing coordinates, topologies and periodic connectivities into a unified structure-aware vocabulary. Treats structural tokens as addressable evidence to produce interpretable prediction traces and improves accuracy across biology, chemistry and materials benchmarks.

A 2019 essay arguing that over 70 years of AI, general methods that scale with computation — search and learning — consistently beat hand-coded human knowledge. The short text that crystallized the scaling-vs-priors debate.

Proposes a router redesign for Mixture-of-Experts (MoE) that aligns each router row with its expert's principal singular direction using Manifold Power Iteration (MPI), improving token–expert affinity. MPI applies a 'power‑then‑retract' step to push router rows toward principal singular vectors while enforcing norm constraints; the paper gives convergence theory and pretraining results on 1B–11B MoE models.