Deep Learning in Neural Networks: An Overview — TEI-tagged view

Jürgen Schmidhuber · 2015 · artificial-intelligence · doi:10.1016/j.neunet.2014.09.003 · full text at the source · TEI xml · tagged edition · index · concepts · authors
Where this record's text came from. faceted 2026-08 by reading the locally held text (pdftext); every evidence string verified as an exact substring of that text before merging. Claim relations left empty on purpose: as a survey the paper relates hundreds of prior works to each other, but it nowhere positions its own contribution against a specific named prior overview, so every candidate relation would be an inference from a bare citation. Claim type is 'method' for the CAP-depth measure, which is the only novel apparatus in the paper; the paper's own self-description is a 'historical survey', and it also carries an implicit critique of the field's citation practice ('Since not all DL publications properly acknowledge earlier relevant work'), which the six-value claim type vocabulary cannot express. Quotes taken only from the body; the reference list (roughly the last 160,000 characters of the file) was excluded. 2026-08-14 and 2026-08-26 schema-0.3 passes: every quote verified as an exact substring of the staged text and anchored at merge time; concept terms verified present; every edge endpoint an existing node.
This record’s own method is review, and the tags below follow from that. A review’s findings, quantities and statistics are things stated IN this paper, and some of them report results obtained elsewhere. No tag on this page names a different author. Measured across every review in this corpus, 81% of a review’s tags carry no citation at all — most of them are the review speaking. The corpus does not adjudicate the rest: read an unmarked tag as a claim this paper makes, not necessarily one it made first.
Other fields define these differently the same word, defined another way in another discipline
deep learning 11 fields · neural networks 3 fields · supervised learning 3 fields · linear regression 2 fields · recurrent neural networks 2 fields
Tags on this paper every tag the record carries, whether or not the words occur in the text below — a number is how many papers in the corpus carry that tag; a tag with no number is unique to this paper
deep learning42 neural network6 backpropagation3 credit assignment shallow learning solution depth problem depth review319

Our tag layer for this paper

Cross-disciplinary analysis
content-tags & facets: phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text
phenomenondeep learning in artificial neural networks— “The present survey, however, will focus on the narrower, but now commercially important, subfield of Deep Learning (DL) in Artificial Neural Networks (NNs).”
claim-typemethod— “To measure whether credit assignment in a given NN application is of the deep or shallow type, I introduce the concept of Credit Assignment Paths or CAPs, which are chains of possibly causal links between the events of Sec. 2, e.g., from input through hidden to output layers in FNNs, or through transformations over time in RNNs.”
method — evidence— “This historical survey compactly summarises relevant work, much of it from the previous millennium.”
transferfrom neuroscience (neurophysiology): incorporating neurophysiological insights into deep neural-network architectures (e.g. the Neocognitron)— “Apart from deep GMDH networks (Sec. 5.3), the Neocognitron (Fukushima, 1979, 1980, 2013a) was perhaps the first artificial NN that deserved the attribute deep, and the first to incorporate the neurophysiological insights of Sec. 5.2.”transfers[0]
mechanismdeep learning = long credit-assignment paths: assign credit or blame for outcomes back through many layers of causal links (done by backpropagation)— “the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects”mechanisms[0]
builds-on half a century of prior neural-network and machine-learning research— “This historical survey compactly summarises relevant work, much of it from the previous millennium.”claim_relations[0]
sensecredit assignment path - chains of possibly learnable causal links between actions and effects, whose DEPTH is what separates shallow from deep learners— “Shallow and deep learners are distinguished by the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects.”senses[0]
sensethe shallow/deep boundary - not a settled criterion: the author reports that experts could not agree and then stipulates a threshold for this overview— “At which problem depth does Shallow Learning end, and Deep Learning begin? Discussions with DL experts have not yet yielded a conclusive response to this question.”senses[1]
senseVery Deep Learning - a threshold defined by stipulation for this survey alone, at problem depth greater than ten— “let me just define for the purposes of this overview: problems of depth > 10 require Very Deep Learning.”senses[2]
sensecredit assignment - also what the survey itself performs, on researchers rather than network links, and which the author says cannot be fully achieved— “this work should be viewed as merely a snapshot of an ongoing credit assignment process”senses[3]
sense'solution depth' / 'problem depth' - A STIPULATIVE CASCADE THAT MAKES 'DEPTH' WELL-DEFINED WHERE THE FIELD'S OWN BOUNDARY IS NOT. Three definitions in one breath: a 'solution' is the set of used weights; the 'solution depth' is the depth of the deepest CAP in that sequence; and the 'problem depth' is 'the smallest depth of any solution'. THE THIRD IS A MINIMUM OVER SOLUTIONS, NOT A PROPERTY OF A NETWORK - so two networks solving one problem can have different solution depths while the problem depth is a single number about the PROBLEM. This record already records, in another of its senses, that experts could not agree where shallow ends and deep begins; this is the same author making the quantity precise by fiat instead of waiting for the field.— “Then the set of used weights is called a solution to the problem, and the depth of the deepest CAP within the sequence is called the solution depth. There may be other solutions (yielding different event sequences) with different depths. Given some fixed NN topology, the smallest depth of any solution is called the problem depth.”senses[4]
sense`deep learning` - THE SURVEY MARKS ITS OWN TERM'S OUTER EDGE AND DECLINES TO CROSS IT: `universal RL methods, which go beyond what is usually called DL`. A scope statement about the EXTENSION of the term rather than its content, and it is deferred to ordinary usage - `what is USUALLY called` - by an author who elsewhere stipulates his own thresholds. THE TERM IS FIXED BY STIPULATION AT ITS CENTRE AND BY CONVENTION AT ITS EDGE.— “Here I won’t further discuss universal RL methods, which go beyond what is usually called DL.”senses[5]
auditdeep learning —distinct-from→ shallow learning — Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but the span says experts have NOT YET given a conclusive answer where shallow learning ends; hedged.— “At which problem depth does Shallow Learning end, and Deep Learning begin? Discussions with DL experts have not yet yielded a conclusive response to this question.”concept_edges[0]
for which uselimitation — the credit-assignment aim of the survey: I ACKNOWLEDGE THE LIMITATIONS OF ATTEMPTING TO ACHIEVE THIS GOAL— “I acknowledge the limitations of attempting to achieve this goal.”limitations[0]
for which uselimitation — the same scope as limitations[0] - the goal is stated as not fully achievable— “I acknowledge the limitations of attempting to achieve this goal.”limitations[1]
for which uselimitation — the coverage of the survey: THROUGH AN EXPERT SELECTION BIAS I MAY HAVE MISSED IMPORTANT WORK— “Nevertheless, through an expert selection bias I may have missed important work.”limitations[2]
for which uselimitation — the balance of attribution: A RELATED BIAS WAS SURELY INTRODUCED BY MY SPECIAL FAMILIARITY WITH THE WORK OF MY OWN DL RESEARCH GROUP IN THE PAST QUARTER-CENTURY— “A related bias was surely introduced by my special familiarity with the work of my own DL research group in the past quarter-century.”limitations[3]
for which uselimitation — every use of the shallow/deep distinction: AT WHICH PROBLEM DEPTH DOES SHALLOW LEARNING END, AND DEEP LEARNING BEGIN? DISCUSSIONS WITH DL EXPERTS HAVE NOT YET YIELDED A CONCLUSIVE RESPONSE— “At which problem depth does Shallow Learning end, and Deep Learning begin? Discussions with DL experts have not yet yielded a conclusive response to this question.”limitations[4]
for which uselimitation — the reinforcement-learning sections: THEY CANNOT SERVE AS A GENERAL RL SURVEY— “The following subsections mostly focus on certain obvious intersections between DL and RL—they cannot serve as a general RL survey.”limitations[5]
replicationuntested
limitationfully and fairly assigning credit to all contributors is not achievable— “I acknowledge the limitations of attempting to achieve this goal.”limitations[0]
limitationThe author states that the credit-assignment goal of the survey cannot be fully achieved.— “I acknowledge the limitations of attempting to achieve this goal.”limitations[1]
limitationCoverage may be incomplete because of expert selection bias.— “Nevertheless, through an expert selection bias I may have missed important work.”limitations[2]
limitationThe survey is biased toward the author's own research group's work.— “A related bias was surely introduced by my special familiarity with the work of my own DL research group in the past quarter-century.”limitations[3]
limitationThe boundary between shallow and deep learning is set by stipulation, not by a settled criterion.— “At which problem depth does Shallow Learning end, and Deep Learning begin? Discussions with DL experts have not yet yielded a conclusive response to this question.”limitations[4]
limitationThe reinforcement-learning part is explicitly not a general survey of that field.— “The following subsections mostly focus on certain obvious intersections between DL and RL—they cannot serve as a general RL survey.”limitations[5]
Content tags
content-observations: finding · quantity · variable · definition · key-term — grounded in the full text
findingdeep networks including recurrent ones won numerous contests— “deep artificial neural networks (including recurrent ones) have won numerous”content_tags.findings[0]
findingshallow and deep learners are distinguished— “Shallow and deep learners are distinguished”content_tags.findings[1]
findingthe survey spans supervised, unsupervised, RL and evolutionary methods— “I review deep supervised learning (also recapitulating the history of backpropagation), unsupervised learning, reinforcement learning & evolutionary computation, and indirect search for short programs encoding deep and large networks.”content_tags.findings[2]
findingmuch of the relevant work dates from the previous millennium— “This historical survey compactly summarises relevant work, much of it from the previous millennium.”content_tags.findings[3]
quantity88 / 888 pages / references — length and citation count of the survey— “(88 pages, 888 references)”content_tags.quantities[0]
quantityhalf century span — history traced back through the ideas— “trace back the origins of relevant ideas through the past half century”content_tags.quantities[1]
quantity1940s era — earliest neural networks reviewed— “Early NNs Since the 1940s (and the 1800s) .”content_tags.quantities[2]
variablecredit assignment paths (CAPs) (chains of causal links whose depth defines depth)— “the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects”content_tags.variables[0]
variableDepth of Credit Assignment Paths (distinguishes shallow from deep learning)— “Depth of Credit Assignment Paths (CAPs) and of Problems 4”content_tags.variables[1]
variablebackpropagation (history recapitulated in the survey)— “also recapitulating the history of backpropagation”content_tags.variables[2]
variableGPUs (hardware enabler for deep learning)— “Fast Graphics Processing Units (GPUs) for DL in NNs .”content_tags.variables[3]
definitioncredit assignment path— “Shallow and deep learners are distinguished by the depth of their credit assignment paths, which are chains of possibly learnable, causal”content_tags.definitions[0]
definitionhierarchical representation learning— “Learning Hierarchical Representations Through Deep SL, UL, RL .”content_tags.definitions[1]
definitionMinimum Description Length (MDL)— “Compression and Minimum Description Length (MDL) .”content_tags.definitions[2]
definitionrecurrent neural networks— “deep artificial neural networks (including recurrent ones)”content_tags.definitions[3]
key-termsdeep learning, neural networks, credit assignment, supervised learning, unsupervised learning, reinforcement learning, backpropagation, pattern recognition, recurrent, depth
Concepts
terms this paper carries, each with the sentence it was cut from — the layer that joins one paper to another. Terms with no quote yet are on CONCEPTS.html.
conceptdeep learning— “At which problem depth does Shallow Learning end, and Deep Learning begin?”concepts[0]
conceptcredit assignment— “Shallow and deep learners are distinguished by the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects.”concepts[3]
conceptshallow learning— “At which problem depth does Shallow Learning end”concepts[4]
conceptsolution depth — not defined in this paper's own words; the depth of the deepest credit-assignment path within one solution's event sequence— “Then the set of used weights is called a solution to the problem, and the depth of the deepest CAP within the sequence is called the solution depth. There may be other solutions (yielding different event sequences) with different depths. Given some fixed NN topology, the smallest depth of any solution is called the problem depth.”concepts[5]
conceptproblem depth — not defined in this paper's own words; the SMALLEST depth over all solutions for a fixed topology - a minimum, not a property of any one network— “Then the set of used weights is called a solution to the problem, and the depth of the deepest CAP within the sequence is called the solution depth. There may be other solutions (yielding different event sequences) with different depths. Given some fixed NN topology, the smallest depth of any solution is called the problem depth.”concepts[6]
Statistics — cross-field join keys
field-invariant statistical terms, used in their statistical sense (gated on a number / symbol / test). A p-value or a standard deviation means the SAME thing in physics, biology, psychology and sociology — so these are the strongest cross-field join keys. Grounded verbatim.
Bayesian— “NN case, the MDL principle suggests that low NN weight complexity corresponds to high NN probability in the Bayesian view (e.g., MacKay, 1992; Buntine and Weigend, 1991; Neal, 1995; De Freitas, 2003), and to high generalization”content_tags.statistics[0]
evidence status noteBayesian — QUOTE REPAIRED: the extractor split a hyphen-space and the quote was recorded faithfully with the damage in it, which made it unanchorable. The repaired string is an EXACT SUBSTRING of the staged text - that is why it was accepted, not because a rule produced it. The text as originally recorded is kept in evidence as extracted.content_tags.statistics[0]
regression β as written: linear regression— “In a sense NNs have been around even longer, since early supervised NNs were essentially variants of linear regression methods going back at least to the early 1800s (e.g., Legendre, 1805; Gauss, 1809, 1821); Gauss also refers to his work of 1795”content_tags.statistics[2]

When we have changed our mind. Some entries in the table begin with a word in capitals and the reason for it. EVIDENCE CORRECTED — the finding still stands, but we had quoted the wrong sentence from the paper, and the quotation has been replaced with the right one. RETRACTED — the entry itself was wrong; it stays on the page, marked, with the reason, rather than being deleted. WITHDRAWN AND REPLACED — the entry was wrong, and a corrected version of it appears in the entries below. Each mark carries its own reason, in brackets, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it. Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote for that row; on this page it is withheld with the article, and the article is at its publisher. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.

Tag layer © the Meta-Tagging Project, CC BY 4.0. The paper text is © its authors/publisher and is linked, not reproduced. Excerpts shown are short quotations for identification and verification. · back to index · concepts · authors · עברית
© 2026 Shir Sivroni · ORCID 0009-0000-2597-2824