Cited by 340Neural Networks and ApplicationsStochastic Gradient Optimization TechniquesAdvanced Neural Network Applications

The DOI matches its Crossref record; 48 of the 50 references it cites were found in a registry or an index.

The dropout learning algorithm

Open access
Baldi, Pierre, Sadowski, Peter·2014·Artificial Intelligence

Abstract

Dropout is a recently introduced algorithm for training neural network by randomly dropping units during training to prevent their co-adaptation. A mathematical analysis of some of the static and dynamic properties of dropout is provided using Bernoulli gating variables, general enough to accommodate dropout on units or connections, and with variable rates. The framework allows a complete analysis of the ensemble averaging properties of dropout in linear networks, which is useful to understand the non-linear case. The ensemble averaging properties of dropout in non-linear logistic networks result from three fundamental equations: (1) the approximation of the expectations of logistic functions by normalized geometric means, for which bounds and estimates are derived; (2) the algebraic equality between normalized geometric means of logistic functions with the logistic of the means, which mathematically characterizes logistic functions; and (3) the linearity of the means with respect to sums, as well as products of independent variables. The results are also extended to other classes of transfer functions, including rectified linear functions. Approximation errors tend to cancel each other and do not accumulate. Dropout can also be connected to stochastic neurons and used to predict firing rates, and to backpropagation by viewing the backward propagation as ensemble averaging in a dropout linear network. Moreover, the convergence properties of dropout can be understood in terms of stochastic gradient descent. Finally, for the regularization properties of dropout, the expectation of the dropout gradient is the gradient of the corresponding approximation ensemble, regularized by an adaptive weight decay term with a propensity for self-consistent variance minimization and sparse representations.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.artint.2014.02.004

Cites

48 of 48 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Show all 50 references

2 of the 50 references couldn’t be matched to a known paper.

Research works printed but not linked: 1

  1. Mercer, 2001, Improved upper and lower bounds for the difference an-gn, J. Math., 31

Cited by

Sorted by citations

Items 301–340 of 340

Metadata

Authors
Baldi, P., & Sadowski, P.
Affiliations
University of California, Irvine (US)
Corresponding author
Baldi, Pierre
Venue
Artificial Intelligence
Publisher
Elsevier BV
Published
2014-05
Volume
210
Pages
78-122
ISSN
0004-3702 (ISSN-L)
OpenAlex
W2164370980
Cited by
340
References
50
Citations by year
2026: 12 · 2025: 23 · 2024: 39 · 2023: 38 · 2022: 19 · 2021: 40 · 2020: 45 · 2019: 31 · 2018: 26 · 2017: 21 · 2016: 24 · 2015: 10 · 2014: 11
FWCI
21.93
Type
journal article
Language
en
Open access
Locations
  • Artificial Intelligence (publishedVersion, cc-by-nc-nd)
  • PubMed (publishedVersion)
  • PubMed Central (acceptedVersion)
  • eScholarship (California Digital Library) (submittedVersion, cc-by-nc-nd)
Funders
  • NSF (IIS-0513376, NSF-IIS-1321053)
  • NIH (LM010235)
  • NIH NLM (T15 LM07443)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
Keywords
dropout, neural network training, ensemble averaging, logistic function, rectified linear units, stochastic neurons, stochastic gradient descent, regularization, weight decay, sparse representation, variance minimization, co-adaptation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review