Back to the reading lists

    Deep learning· 2012

    Dropout: A Simple Way to Prevent Neural Networks from Overfitting

    Nitish Srivastava (first author) · 2012 · published 2014

    Read the original

    arXiv 1207.0580OpenAlex W2095705004

    Train a sampled subnetwork.

    On the reading lists

    Why it matters

    Established dropout as a simple, widely adopted regularization technique for neural networks.

    Condensed from the expert lists' notes.

    Inside the paper

    The problem
    Large neural networks can fit their training data closely while performing less well on new examples. Averaging many separately trained networks is one response, but it can be expensive at prediction time.
    The idea
    Dropout trains a network with randomly chosen units temporarily removed on each presentation of data. The paper treats the resulting collection of thinned networks as an approximation to a large ensemble.
    How it works
    • Choose which units to retain using independent random draws, and omit the dropped units and their connections for that training update.
    • Compute predictions and gradients through the remaining network, updating the weights that participated in that pass.
    • Resample the retained units for subsequent training examples, so different subsets share and update the same underlying weights.
    • At test time, use the full network with appropriately scaled weights to approximate averaging predictions across the thinned networks.
    What it showed
    The authors report improved generalization over networks without dropout on the datasets they study, including image, speech and text tasks. They also compare the test-time scaling approximation with sampling multiple dropout networks.
    Read it for
    Read Sections 2 and 3 for the mechanism and ensemble interpretation, then Section 6 for the experiments. Section 7.5 is useful for understanding the approximation; the later restricted Boltzmann machine discussion can be skimmed initially.

    Written in our own words from the paper itself. A draft the editors have not yet reviewed.

    Reading it

    Difficulty: Introductory

    Read this first: neural network basics (backpropagation); overfitting and regularisation.

    The record

    First released
    2012 (from arXiv 1207.0580)
    Published
    2014
    Citations
    45,097 citations, as counted by Semantic Scholar logoSemantic Scholar (non-commercial licence)
    Named by
    both expert lists
    Score
    0.712 · computed rank 59 · consensus 0.8, must-read 1, citations percentile 0.919 (2010s · deep-learning), awards 0, existing lists 0.5. Method

    Editor's notes

    • Readability check: pass: Long but gentle; a regulariser everyone uses. (AI draft (Claude), not yet reviewed, 2026-10-29)

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0), and Semantic Scholar logoSemantic Scholar (used under its non-commercial API licence). Each count names its source. See the method.