Opening the book…
We provide a brief history of neural networks (NN) and deep learning (DL) up to 2017, the year “Attention Is All You Need” was published (which marks the beginning of large language models (LLMs)). We will have sections on LLMs.
-
1943: The McCulloch-Pitts model
First mathematical model of neural networks; foundational for the field.
-
1949: Hebb’s Rule
Introduced Hebbian learning: “neurons that fire together wire together.”
-
1958: The Perceptron model by Rosenblatt
First trainable artificial neural network (ANN) capable of binary classification.
-
1960: ADALINE/MADALINE (by Widrow & Hoff)
ADALINE = Adaptive Linear Neuron or Adaptive Linear Element) and MADALINE = Multiple ADALINE. Neural networks using least mean squares learning; early adaptive systems.
-
1960s: Minsky & Papert’s book, Perceptrons
Began studies on the limitations of perceptrons. 1969: Published Perceptrons (1st ed.), systematically proving the limitations of single-layer perceptrons — especially their inability to solve problems like XOR. A major factor leading to the first AI Winter. Note: An expanded edition was published in 1988 with a prologue and epilogue addressing criticisms and discussing the revival of neural nets. In 2017, the expanded edition was reprinted, including a new foreword discussing the book’s impact from the perspective of modern deep learning.
-
1960s–early 70s: Various developments
Group Method of Data Handling by Alexey Ivakhnenko and V. G. Lapa (1968). Multilayer perceptron (early deep learning) trained via stochastic gradient descent by Amari (1967–68).
-
1980: Neocognitron (Fukushima)
Early convolutional neural network for visual pattern recognition. Inspired by the work of Hubel and Wiesel (1950s and 60s), building on Fukushima’s earlier work (including the Cognitron). Recognized as the direct precursor to modern Convolutional Neural Networks (CNNs).
-
1982: Hopfield Network (Hopfield), or Amari-Hopfield Network
Recurrent network using energy minimization for pattern storage and retrieval. Amari (1972) discovered a network equivalent to the Hopfield network. (Note: Amari is credited as the founder of information geometry.) Hopfield was awarded the 2024 Nobel Prize in Physics (shared with Geoffrey Hinton).
-
1980s: Recurrent Neural Networks (RNNs)
Designed for processing sequential data where each output depends on previous inputs. Including the Jordan Network (1986) and Elman Network (1990).
-
1985–86: Restricted Boltzmann Machine (RBM; Hinton, Sejnowski, & Smolensky)
Stochastic generative model with bipartite structure; important for unsupervised learning. Hinton and coworkers trained it with fast learning algorithms, such as Contrastive Divergence. In the mid-2000s, RBMs became the building blocks for Deep Belief Networks (DBNs) and other deep learning architectures.
-
1986: Backpropagation (Rumelhart, Hinton, Williams)
Popularized practical training for multilayer perceptrons using backpropagation. Inspired by the work by Rosenblatt (1962: “back-propagating error correction”), Dreyfus (62, depending on Bryson and Kelley around the same time), Linnainmaa (1970), and Werbos (1974).
-
1989: LeNet (LeCun)
Applied CNNs to handwritten digit recognition; deployed in real-world applications. The concepts were developed by LeCun and its team at AT&T in the late 80s. Refined in the early 90s, and LeNet-5 was released in 98 (successful for digit recognition). In the late 90s, it was used in industry (notably for reading handwritten checks and postal codes in banks and ATMs).
-
1997: Long Short-Term Memory (LSTM, by Hochreiter & Schmidhuber)
LSTM (Long Short-Term Memory) Enabled learning long-term dependencies in sequences; a solution to vanishing gradients in RNNs. Each unit has a memory cell with controlled update mechanisms, and three gates (input, forget, and output gates), which are crucial for long-term information retention and gradient flow in deep networks.
Note also the Gated Recurrent Units (GRUs). They are RNN-type networks, introduced in 2014 by Cho et. al., to efficiently process sequential data by using two main gates (the reset gate and the update gate), allowing the networks to selectively forget and retain information at each time step, effectively solving the vanishing gradient problem and enabling the learning of both short-term and long-term dependencies in sequences.
-
2011: DanNet (Ciresan et al.)
First pure deep GPU-based CNN to win major international computer vision contests (IJCNN, ICDAR).
-
2012: AlexNet (Krizhevsky et al.)
It won ImageNet with a large margin; triggers the DL revolution.
-
2014: Seq2Seq with Attention (Bahdanau et al.)
Introduced the attention mechanism in sequence modeling; boosts translation and NLP tasks.
-
2015: ResNet (He et al.)
It uses residual connections (skip connections) to enable the training of very deep networks (100+ layers) by mitigating the vanishing gradient problem.
-
2017: Transformer (Vaswani et al.)
“Attention is All You Need”: Introduced Transformers, revolutionizing NLP. It marks the dawn of a new era in AI/ML. We will include sections on this and on subsequent developments inspired by it.
Further Exploration
-
See the following sources for full reference information.
Jürgen Schmidhuber. Deep learning in neural networks: An overview. Neural Networks, vol. 61, pp. 85–117, 2015.
Jürgen Schmidhuber. Timeline of machine learning and deep learning research. 2015–2022. IDSIA, Switzerland.
-
The McCulloch-Pitts model (1943)
-
The first mathematical abstraction of a biological neuron, forming the foundation for NNs.
-
Consider a single McCulloch-Pitts (MCP) neuron, with n inputs and one output.
-
Each input xi ∈ {0, 1} (representing the state of the i-th neuron as firing and not firing)
-
The weight {wi} represents the strength of the synapse connecting the xi to the output. It can be positive or negative corresponding to an excitatory or inhibitory synapse resp.
-
-
The activation is a threshold function: the neuron outputs 1 if the sum reaches or exceeds a specified threshold θ, otherwise outputs 0. Indeed, the output, y, is given by
where H is the Heaviside function (or, step function). Later models use more general non-linear functions instead of H.
$$\label{01A=01} y = H\left( \sum_{i=1}^{n} w_i x_i - \theta \right)$$ -
Summary of behaviour:
-
The neuron fires (outputs 1) if activation ≥ θ.
-
Otherwise, the output is 0.
-
-
Limitations:
-
Only handles binary inputs and outputs.
-
It can only model linearly separable functions and cannot learn from data.
-
-
The McCulloch-Pitts model is an abstract, early model describing a neuron as a simple logic gate, without accounting for membrane dynamics or temporal features. In contrast, the Hodgkin-Huxley model (or, its simplified versions, such as the leaky integrate-and-fire (LIF) model) is a much more detailed and biophysically accurate representation, describing how action potentials are generated and propagated using nonlinear differential equations. For details, see, e.g.,
-
Ermentrout, G. B., & Terman, D. H. (2010). Mathematical Foundations of Neuroscience. New York: Springer.
-
Dayan, P., & Abbott, L. F. (2001). Theoretical Neuroscience: Computational and Mathematical Modeling of Neural Systems. Cambridge, MA: MIT Press.
-
-
This page titled 1.2: A Brief History of Neural Networks and Deep Learning was last modified on Mon, 10 Aug 2026 12:25:13 GMT and is shared under a CC BY-NC-SA 4.0 license and was authored, remixed, and/or curated by Hei-Chi Chan.
The book could not be loaded just now.