Distributed Training · 2016
Training Deep Nets with Sublinear Memory Cost (Activation Checkpointing)
This work trades compute for memory by discarding most intermediate activations during the forward pass and recomputing them during the backward pass, cutting activation memory for an n-layer network from linear to about the square root of n.
Editorial record
Plain-language summary
During the forward pass only a sparse set of checkpoint activations is kept and the rest are dropped; during backpropagation the missing activations are recomputed on demand from the nearest checkpoint. Placing checkpoints roughly every sqrt(n) layers reduces activation memory to O(sqrt(n)) at the cost of one extra forward computation. This gradient/activation checkpointing let much deeper networks and longer sequences be trained within a fixed GPU memory budget, and became a standard building block in later large-model training systems.
Source record
Provenance
- Record ID
- P-137
- Record created
- 2026-07-13
- Last reviewed
- 2026-07-14
- Record version
- 2
- https://arxiv.org/abs/1604.06174
- arXiv:1604.06174
Citation caveat: Citation metadata is approximate and marked unverified in the source dataset.