The biggest models now train with dropout turned down or off
Srivastava and Hinton's 2014 paper cut CIFAR-10 error to 12.61% and led the small benchmarks of its day, then showed in its own experiments why models trained on far more data need it less.
Why this matters
If you have read anything about how neural networks avoid memorizing their training data, you have met dropout. It is one of the most cited techniques in the field, and for most of the 2010s it was in almost every network. It is also routinely misdescribed as a general cure for overfitting. This lesson reads the paper that introduced it. By the end you can say what dropout does to a network, why its authors thought it worked, what it measured, and why the largest models now often turn it down or switch it off. That last part is the correction worth carrying: the same paper people cite to call dropout indispensable also measured the conditions under which it stops helping.
- 01
- Batch normalization: the normalization layer that later crowded dropout out of vision networks.
- 02
- Deep double descent: how a model's error can fall, rise, and fall again as its capacity grows past its data.
Half the network vanishes on every training pass
Dropout is usually explained as a switch that stops a network from overfitting. What Nitish Srivastava, Geoffrey Hinton, and three colleagues actually described in 2014 is narrower and stranger. During training, each unit in the network is kept with a fixed probability p and otherwise set to zero. The choice is made independently for every unit on every training case, so no single training pass ever runs on the whole network.1
What is dropped is whole units, not individual weights: a dropped unit is removed for that pass along with all of its incoming and outgoing connections. The dropping is also random and temporary, so a unit that is gone on one case is likely back on the next. The paper keeps hidden units with probability 0.5 and input units with probability 0.8, values chosen on a held-out set.1
Training on a different random slice of the network each pass would be useless if the finished network could not then be used as a whole. The paper's answer is a scaling rule. At test time the complete network runs once, with every unit present, but each unit's outgoing weights are multiplied by p. A unit kept half the time during training sent, on average, half its signal downstream. Halving its weights at test time keeps that average the same, so the downstream units see the input they were trained on.1 The paper has been cited more than 44,000 times.2
Training many networks by training one
The idea first appeared two years earlier, in a 2012 report whose title states the reason its authors believed in it: preventing the co-adaptation of feature detectors.3 Their worry was that a unit which can always count on a particular partner being present will learn to lean on it, becoming useful only inside that fixed arrangement. Remove partners at random and a unit can no longer depend on any one of them, so it has to learn something that helps across many different combinations.1
The 2014 paper gives that intuition a second, sharper form. Choosing which units to keep carves a smaller network out of the full one, and a network with n units contains 2ⁿ such thinned networks. Dropout trains a different one of them on nearly every pass, and because they all draw from the same pool of weights, no thinned network needs its own copy.
Dropout trains an ensemble of 2ⁿ smaller networks that share one set of weights, then folds them back into a single network at test time. The weight scaling is what does the folding.1
The test-time scaling is an approximate way of averaging the 2ⁿ networks, not an exact one. To check it, they also averaged the predictions of many thinned networks sampled at random, and found that the single scaled network matches that Monte-Carlo average once about 50 samples are drawn.1 So the ensemble story is an intuition backed by an approximation that holds up well in practice, not a theorem about what the network computes.
How far it moved the error rates of 2012
The 2012 report had already claimed records on speech and object recognition.3 The 2014 paper ran dropout across the standard benchmarks of the moment and reported a consistent drop in error on every one of them. These were the datasets the field measured itself against at the time: handwritten digits, house numbers, small object photos, phone recognition in speech, and topic classification in text.
| Benchmark | No dropout | With dropout |
|---|---|---|
| MNIST digits | 1.60% | 1.06% |
| SVHN house numbers | 3.95% | 2.55% |
| CIFAR-10 objects | 14.98% | 12.61% |
| CIFAR-100 objects | 43.48% | 37.20% |
| ImageNet 2012 (top-5) | ≈26% | 16.4% |
| TIMIT speech | 23.4% | 21.8% |
| Reuters topics | 31.05% | 29.62% |
The gains are real and, in vision, large: dropout took the winning ImageNet 2012 network to a top-5 error of 16.4% when the best classical methods sat near 26%.1 They are also uneven. On Reuters text the error moved only from 31.05% to 29.62%, an improvement the paper calls much smaller than the ones it saw on images and speech.1 The method was not free either. Dropout raised training time roughly two to three times, the paper reports, because its updates are noisy: each training pass fits a different thinned network, so the gradients do not point at the full one used at test time.1
The gain shrinks as the data grows
The uneven benchmark gains were not noise, and the paper measured why. The authors trained the same MNIST network on subsets of the data ranging from 100 examples up to 50,000, with dropout and without, and watched the gap between the two. 1
At the smallest sizes, 100 and 500 examples, dropout gave no improvement at all. A network this large overfits so small a training set even with the noise dropout adds, so there is no gain left for the regularization to win. As the training set grew, dropout's advantage rose to a peak. Then, as the set grew larger still, the advantage narrowed again, because a network with enough data overfits less on its own.1
Dropout's value is not a fixed property of the technique. It depends on the ratio between how much a network can memorize and how much data it is shown, and the paper measured a regime on each side where the technique buys little. The benchmarks of 2012 sat in the middle of that range, where models were large relative to the data available, which is exactly where dropout pays.
Where the largest models leave it off
The same curve, extended toward far larger datasets, describes how dropout is used now. The 2017 Transformer, the architecture behind today's language models, kept dropout but cut the rate to 0.1 for its base model, reserving 0.3 for one large translation model. Its own ablation still calls dropout very helpful in avoiding overfitting.4 The technique carried forward into modern networks, at a fifth of the original rate.
It also ran into a rival. Once batch normalization became standard in vision networks, the two were found to interfere. A 2018 analysis showed a DenseNet on CIFAR-100 falling from 77.42% accuracy to 68.55% when dropout at rate 0.5 was added inside each block. The cause was a mismatch between the variance dropout produces at training time and the variance the normalization layer expects at test time. A small dose of dropout, 0.1 to 0.2, applied only after the normalization layers, restored consistent small gains.5
The clearest break comes at the largest scale. PaLM, a 540-billion-parameter language model trained on 780 billion tokens, was trained with no dropout during pretraining at all, using a rate of 0.1 only when it was later finetuned.6 A 2025 study tested this directly and found that removing dropout improves single-epoch language-model pretraining across language modeling, syntax, question answering, and inference benchmarks, and notes that LLaMA reports no dropout use.7 The reason lines up with the paper's own curve. A model that sees each of a near-endless supply of examples only once barely overfits. That is the far end of the data axis, where dropout's measured benefit had already gone flat.
It is not that dropout was abandoned. It is still set to 0.1 in the Transformer, still used to finetune PaLM, and still helpful in small doses after normalization layers in vision. Its role narrowed to those regimes rather than ending. And the picture of dropout being switched off at scale rests on the few labs that publish a setting: PaLM states it, LLaMA omits it, the 2025 study tests it.7 Frontier proprietary models do not disclose theirs, so this reads from a handful of disclosed reports rather than a survey of the field.
The takeaway
Dropout drops units at random during training, keeping each with probability p, and scales the surviving weights by p at test time so the whole network can stand in for the many thinned ones it trained. Its authors justified it two ways, both worth stating as theirs: it stops units from co-adapting, and it approximates an average over 2ⁿ weight-sharing networks. On the small benchmarks of 2012 it produced real gains, largest on images and smallest on text. The one experiment to remember is the one about dataset size: dropout helps most when a model is large relative to its data, and its own measurements showed the benefit fading as data grows. That is why the largest models, trained on far more data than anything in the original paper, now turn the rate down or leave it off. If someone tells you dropout is a universal necessity, the correction is in the paper they are citing.
- 01
- Srivastava et al., "Dropout" (JMLR 2014): the full paper, including the per-dataset tables and the dataset-size figure this lesson samples.
- 02
- "Drop Dropout on Single-Epoch Language Model Pretraining" (2025): the recent experiment testing dropout's removal in modern pretraining.
Sources
- JMLR · Srivastava, Hinton, Krizhevsky, Sutskever, Salakhutdinov, "Dropout: A Simple Way to Prevent Neural Networks from Overfitting" (2014)
- Semantic Scholar · citation record for "Dropout: A Simple Way to Prevent Neural Networks from Overfitting"
- arXiv · Hinton, Srivastava, Krizhevsky, Sutskever, Salakhutdinov, "Improving neural networks by preventing co-adaptation of feature detectors" (2012)
- arXiv · Vaswani et al., "Attention Is All You Need" (2017)
- arXiv · Li, Chen, Hu, Yang, "Understanding the Disharmony between Dropout and Batch Normalization by Variance Shift" (2018)
- arXiv · Chowdhery et al., "PaLM: Scaling Language Modeling with Pathways" (2022)
- arXiv · Liu, Bauer, Manning, "Drop Dropout on Single-Epoch Language Model Pretraining" (2025)