Backpropagation Explained

In machine learning, backpropagation is a gradient estimation method commonly used for training neural networks to compute the network parameter updates.

It is an efficient application of the chain rule to neural networks. Backpropagation computes the gradient of a loss function with respect to the weights of the network for a single input–output example, and does so efficiently, computing the gradient one layer at a time, iterating backward from the last layer to avoid redundant calculations of intermediate terms in the chain rule; this can be derived through dynamic programming.^{[1] [2]}

Strictly speaking, the term backpropagation refers only to an algorithm for efficiently computing the gradient, not how the gradient is used; but the term is often used loosely to refer to the entire learning algorithm – including how the gradient is used, such as by stochastic gradient descent, or as an intermediate step in a more complicated optimizer, such as Adam.^[3]

Backpropagation had multiple discoveries and partial discoveries, with a tangled history and terminology. See the history section for details. Some other names for the technique include "reverse mode of automatic differentiation" or "reverse accumulation".^[4]

Overview

Backpropagation computes the gradient in weight space of a feedforward neural network, with respect to a loss function. Denote:

x : input (vector of features)y : target output

For classification, output will be a vector of class probabilities (e.g.,

( 0 . 1 , 0 . 7 , 0 . 2 ) , and target output is a specific class, encoded by the one-hot/dummy variable (e.g., ( 0 , 1 , 0 ) ).C : loss function or "cost function"

For classification, this is usually cross-entropy (XC, log loss), while for regression it is usually squared error loss (SEL).

L : the number of layersW ^{l} = (w ^{l} _{jk} ) : the weights between layer l - 1 and l , where w ^{l} _{jk} is the weight between the k -th node in layer l - 1 and the j -th node in layer l f ^{l} : activation functions at layer l

For classification the last layer is usually the logistic function for binary classification, and softmax (softargmax) for multi-class classification, while for the hidden layers this was traditionally a sigmoid function (logistic function or others) on each node (coordinate), but today is more varied, with rectifier (ramp, ReLU) being common.

a ^{l} _{j} : activation of the j -th node in layer l .

In the derivation of backpropagation, other intermediate quantities are used by introducing them as needed below. Bias terms are not treated specially since they correspond to a weight with a fixed input of 1. For backpropagation the specific loss function and activation functions do not matter as long as they and their derivatives can be evaluated efficiently. Traditional activation functions include sigmoid, tanh, and ReLU. swish^[5] mish,^[6] and other activation functions have since been proposed as well.

The overall network is a combination of function composition and matrix multiplication:

g(x) : = f ^{L(W} ^{L} f ^{L-1} (W ^{L-1} … f ^{1(W} ^{1} x) … ))

For a training set there will be a set of input–output pairs,

\left\{(x _{i,} y _{i)\right\}} . For each input–output pair (x _{i,} y _{i)} in the training set, the loss of the model on that pair is the cost of the difference between the predicted output g(x _{i)} and the target output y _{i} :C(y _{i,} g(x _{i))}

Note the distinction: during model evaluation the weights are fixed while the inputs vary (and the target output may be unknown), and the network ends with the output layer (it does not include the loss function). During model training the input–output pair is fixed while the weights vary, and the network ends with the loss function.

Backpropagation computes the gradient for a fixed input–output pair

(x _{i,} y _{i)} , where the weights w ^{l} _{jk} can vary. Each individual component of the gradient, \partial C/\partial w ^{l} _{jk} , can be computed by the chain rule; but doing this separately for each weight is inefficient. Backpropagation efficiently computes the gradient by avoiding duplicate calculations and not computing unnecessary intermediate values, by computing the gradient of each layer – specifically the gradient of the weighted input of each layer, denoted by \delta ^{l} – from back to front.

Informally, the key point is that since the only way a weight in

W ^{l} affects the loss is through its effect on the next layer, and it does so linearly, \delta ^{l} are the only data you need to compute the gradients of the weights at layer l , and then the previous layer can be computed \delta ^{l-1} and repeated recursively. This avoids inefficiency in two ways. First, it avoids duplication because when computing the gradient at layer l , it is unnecessary to recompute all derivatives on later layers l +1 , l +2 , \ldots each time. Second, it avoids unnecessary intermediate calculations, because at each stage it directly computes the gradient of the weights with respect to the ultimate output (the loss), rather than unnecessarily computing the derivatives of the values of hidden layers with respect to changes in weights \partial a ^{l'} _{j'} /\partial w ^{l} _{jk} .

Backpropagation can be expressed for simple feedforward networks in terms of matrix multiplication, or more generally in terms of the adjoint graph.

Matrix multiplication

For the basic case of a feedforward network, where nodes in each layer are connected only to nodes in the immediate next layer (without skipping any layers), and there is a loss function that computes a scalar loss for the final output, backpropagation can be understood simply by matrix multiplication. Essentially, backpropagation evaluates the expression for the derivative of the cost function as a product of derivatives between each layer from right to left – "backwards" – with the gradient of the weights between each layer being a simple modification of the partial products (the "backwards propagated error").

Given an input–output pair

(x, y) , the loss is:C(y, f ^{L(W} ^{L} f ^{L-1} (W ^{L-1} … f ^{2(W} ^{2} f ^{1(W} ^{1} x)) … )))

To compute this, one starts with the input

x and works forward; denote the weighted input of each hidden layer as z ^{l} and the output of hidden layer l as the activation a ^{l} . For backpropagation, the activation a ^{l} as well as the derivatives (f ^{l)'} (evaluated at z ^{l} ) must be cached for use during the backwards pass.

The derivative of the loss in terms of the inputs is given by the chain rule; note that each term is a total derivative, evaluated at the value of the network (at each node) on the input

x :(d C)/(d a ^{L}) ⋅ (d a ^{L})/(d z ^{L}) ⋅ (d z ^{L})/(d a ^{L-1}) ⋅ (d a ^{L-1})/(d z ^{L-1}) ⋅ (d z ^{L-1})/(d a ^{L-2}) ⋅ \ldots ⋅ (d a ^{1})/(d z ^{1}) ⋅ (\partial z ^{1})/(\partial x) , where (d a ^{L})/(d z ^{L}) is a diagonal matrix.

These terms are: the derivative of the loss function; the derivatives of the activation functions; and the matrices of weights:

(d C)/(d a ^{L}) \circ (f ^{L)'} ⋅ W ^{L} \circ (f ^{L-1} )' ⋅ W ^{L-1} \circ … \circ (f ^{1)'} ⋅ W ^{1.}

The gradient

\nabla is the transpose of the derivative of the output in terms of the input, so the matrices are transposed and the order of multiplication is reversed, but the entries are the same:\nabla _{x} C = (W ^{1)} ^{T} ⋅ (f ^{1)'} \circ \ldots \circ (W ^{L-1} ) ^{T} ⋅ (f ^{L-1} )' \circ (W ^{L)} ^{T} ⋅ (f ^{L)'} \circ \nabla _{a ^{L}} C.

Backpropagation then consists essentially of evaluating this expression from right to left (equivalently, multiplying the previous expression for the derivative from left to right), computing the gradient at each layer on the way; there is an added step, because the gradient of the weights is not just a subexpression: there's an extra multiplication.

Introducing the auxiliary quantity

\delta ^{l} for the partial products (multiplying from right to left), interpreted as the "error at level l " and defined as the gradient of the input values at level l :\delta ^{l} : = (f ^{l)'} \circ (W ^{l+1} ) ^{T ⋅ (f} ^{l+1} )' \circ … \circ (W ^{L-1} ) ^{T} ⋅ (f ^{L-1} )' \circ (W ^{L)} ^{T} ⋅ (f ^{L)'} \circ \nabla _{a ^{L}} C. Note that \delta ^{l} is a vector, of length equal to the number of nodes in level l ; each component is interpreted as the "cost attributable to (the value of) that node".

The gradient of the weights in layer

l is then:\nabla _{W ^{l}} C = \delta ^{l(a} ^{l-1} ) ^{T.} The factor of a ^{l-1} is because the weights W ^{l} between level l - 1 and l affect level l proportionally to the inputs (activations): the inputs are fixed, the weights vary.

The

\delta ^{l} can easily be computed recursively, going from right to left, as:\delta ^{l-1} : = (f ^{l-1} )' \circ (W ^{l)} ^{T} ⋅ \delta ^{l.}

The gradients of the weights can thus be computed using a few matrix multiplications for each level; this is backpropagation.

Compared with naively computing forwards (using the

\delta ^{l} for illustration):\begin{align} \delta ^{1} & = (f ^{1)'} \circ (W ^{2)} ^{T} ⋅ (f ^{2)'} \circ … \circ (W ^{L-1} ) ^{T} ⋅ (f ^{L-1} )' \circ (W ^{L)} ^{T} ⋅ (f ^{L)'} \circ \nabla _{a ^{L}} C\\ \delta ^{2} & = (f ^{2)'} \circ … \circ (W ^{L-1} ) ^{T} ⋅ (f ^{L-1} )' \circ (W ^{L)} ^{T} ⋅ (f ^{L)'} \circ \nabla _{a ^{L}} C\\ &\vdots\\ \delta ^{L-1} & = (f ^{L-1} )' \circ (W ^{L)} ^{T} ⋅ (f ^{L)'} \circ \nabla _{a ^{L}} C\\ \delta ^{L} & = (f ^{L)'} \circ \nabla _{a ^{L}} C, \end{align}

There are two key differences with backpropagation:

1. Computing

\delta ^{l-1} in terms of \delta ^{l} avoids the obvious duplicate multiplication of layers l and beyond.

1. Multiplying starting from

\nabla _{a ^{L}} C – propagating the error backwards – means that each step simply multiplies a vector (\delta ^{l} ) by the matrices of weights (W ^{l)} ^{T} and derivatives of activations (f ^{l-1} )' . By contrast, multiplying forwards, starting from the changes at an earlier layer, means that each multiplication multiplies a matrix by a matrix. This is much more expensive, and corresponds to tracking every possible path of a change in one layer l forward to changes in the layer l +2 (for multiplying W ^{l+1} by W ^{l+2} , with additional multiplications for the derivatives of the activations), which unnecessarily computes the intermediate quantities of how weight changes affect the values of hidden nodes.

Adjoint graph

For more general graphs, and other advanced variations, backpropagation can be understood in terms of automatic differentiation, where backpropagation is a special case of reverse accumulation (or "reverse mode").

Intuition

Motivation

The goal of any supervised learning algorithm is to find a function that best maps a set of inputs to their correct output. The motivation for backpropagation is to train a multi-layered neural network such that it can learn the appropriate internal representations to allow it to learn any arbitrary mapping of input to output.^[7]

Learning as an optimization problem

To understand the mathematical derivation of the backpropagation algorithm, it helps to first develop some intuition about the relationship between the actual output of a neuron and the correct output for a particular training example. Consider a simple neural network with two input units, one output unit and no hidden units, and in which each neuron uses a linear output (unlike most work on neural networks, in which mapping from inputs to outputs is non-linear) that is the weighted sum of its input.

Initially, before training, the weights will be set randomly. Then the neuron learns from training examples, which in this case consist of a set of tuples

(x _{1,} x _{2,} t) where x _{1} and x _{2} are the inputs to the network and is the correct output (the output the network should produce given those inputs, when it has been trained). The initial network, given x _{1} and x _{2} , will compute an output that likely differs from (given random weights). A loss function L(t, y) is used for measuring the discrepancy between the target output and the computed output . For regression analysis problems the squared error can be used as a loss function, for classification the categorical cross-entropy can be used.

As an example consider a regression problem using the square error as a loss:

L(t, y) = (t - y) ^{2} = E,

where is the discrepancy or error.Consider the network on a single training case:

( 1 , 1 , 0 ) . Thus, the input x _{1} and x _{2} are 1 and 1 respectively and the correct output, is 0. Now if the relation is plotted between the network's output on the horizontal axis and the error on the vertical axis, the result is a parabola. The minimum of the parabola corresponds to the output which minimizes the error . For a single training case, the minimum also touches the horizontal axis, which means the error will be zero and the network can produce an output that exactly matches the target output . Therefore, the problem of mapping inputs to outputs can be reduced to an optimization problem of finding a function that will produce the minimal error.

However, the output of a neuron depends on the weighted sum of all its inputs:

y = x _{1w} _{1} + x _{2w} _{2,}

where

w _{1} and w _{2} are the weights on the connection from the input units to the output unit. Therefore, the error also depends on the incoming weights to the neuron, which is ultimately what needs to be changed in the network to enable learning.

In this example, upon injecting the training data

( 1 , 1 , 0 ) , the loss function becomesE = (t - y) ^{2} = y ^{2} = (x _{1w} _{1} + x _{2w} ^{2} ^{2 )} = (w _{1} + w ^{2 .} _{2 )}

Then, the loss function

E takes the form of a parabolic cylinder with its base directed along w _{1} = - w _{2} . Since all sets of weights that satisfy w _{1} = - w _{2} minimize the loss function, in this case additional constraints are required to converge to a unique solution. Additional constraints could either be generated by setting specific conditions to the weights, or by injecting additional training data.

One commonly used algorithm to find the set of weights that minimizes the error is gradient descent. By backpropagation, the steepest descent direction is calculated of the loss function versus the present synaptic weights. Then, the weights can be modified along the steepest descent direction, and the error is minimized in an efficient way.

Derivation

The gradient descent method involves calculating the derivative of the loss function with respect to the weights of the network. This is normally done using backpropagation. Assuming one output neuron, the squared error function is

E = L(t, y)

where

L is the loss for the output y and target value t ,t is the target output for a training sample, andy is the actual output of the output neuron.

For each neuron

j , its output o _{j} is defined aso _{j} = \varphi( net _{j)} = \varphi\left(\sum ^{n} _{k =1} w _{kj} x _{k\right),} \varphi is non-linear and differentiable over the activation region (the ReLU is not differentiable at one point). A historically used activation function is the logistic function:\varphi(z) = (1)/(1+ e ^{-z})

which has a convenient derivative of:

(d \varphi)/(d z) = \varphi(z)( 1- \varphi(z))

The input

net _{j} to a neuron is the weighted sum of outputs o _{k} of previous neurons. If the neuron is in the first layer after the input layer, the o _{k} of the input layer are simply the inputs x _{k} to the network. The number of input units to the neuron is n . The variable w _{kj} denotes the weight between neuron k of the previous layer and neuron j of the current layer.

Finding the derivative of the error

Calculating the partial derivative of the error with respect to a weight

w _{ij} is done using the chain rule twice: In the last factor of the right-hand side of the above, only one term in the sum net _{j} depends on w _{ij} , so that

If the neuron is in the first layer after the input layer,

o _{i} is just x _{i} .

The derivative of the output of neuron

j with respect to its input is simply the partial derivative of the activation function:(\partial o _{j})/(\partial net _{j}) = (\partial)/(\partial net _{j}) \varphi( net _{j)} = \varphi( net _{j)(1-\varphi(net} _{j))} = o _{j(1-o} _{j)}

This is the reason why backpropagation requires that the activation function be differentiable. (Nevertheless, the ReLU activation function, which is non-differentiable at 0, has become quite popular, e.g. in AlexNet)

The first factor is straightforward to evaluate if the neuron is in the output layer, because then

o _{j} = y and

If half of the square error is used as loss function we can rewrite it as

(\partial E)/(\partial o _{j}) = (\partial E)/(\partial y) = (\partial)/(\partial y) (1)/(2) (t - y) ^{2} = y - t

However, if

j is in an arbitrary inner layer of the network, finding the derivative E with respect to o _{j} is less obvious.

Considering

E as a function with the inputs being all neurons L = \{u, v, ... , w\} receiving input from neuron j ,(\partial E(o _{j)})/(\partial o _{j}) = (\partial E( net _{u,} net _{v,} ... , net _{w)})/(\partial o _{j})

and taking the total derivative with respect to

o _{j} , a recursive expression for the derivative is obtained:

Therefore, the derivative with respect to

o _{j} can be calculated if all the derivatives with respect to the outputs o _{\ell} of the next layer – the ones closer to the output neuron – are known. [Note, if any of the neurons in set <math>L</math> were not connected to neuron <math>j</math>, they would be independent of <math>w_{ij}</math> and the corresponding partial derivative under the summation would vanish to 0.]

Substituting, and in we obtain:

(\partial E)/(\partial w _{ij}) = (\partial E)/(\partial o _{j}) (\partial o _{j})/(\partial net _{j}) (\partial net _{j})/(\partial w _{ij}) = (\partial E)/(\partial o _{j}) (\partial o _{j})/(\partial net _{j}) o _{i} (\partial E)/(\partial w _{ij}) = o _{i} \delta _{j}

with

\delta _{j} = (\partial E)/(\partial o _{j}) (\partial o _{j})/(\partial net _{j}) = \begin{cases} (\partial L(t, o _{j)})/(\partial o _{j}) (d \varphi( net _{j)})/(d net _{j}) & if j isanoutputneuron, \\ (\sum _{\ell\in} w _{j} \delta _{\ell) (d \varphi( net _{j)})/(d net _{j})} & if j isaninnerneuron. \end{cases}

if

\varphi is the logistic function, and the error is the square error:\delta _{j} = (\partial E)/(\partial o _{j}) (\partial o _{j})/(\partial net _{j}) = \begin{cases} (o _{j-t} _{j)o} _{j(1-o} _{j} ) & if j isanoutputneuron, \\ (\sum _{\ell\in} w _{j} \delta _{\ell)o} _{j(1-o} _{j)} & if j isaninnerneuron. \end{cases}

To update the weight

w _{ij} using gradient descent, one must choose a learning rate, η > 0 . The change in weight needs to reflect the impact on E of an increase or decrease in w _{ij} . If (\partial E)/(\partial w _{ij}) > 0 , an increase in w _{ij} increases E ; conversely, if (\partial E)/(\partial w _{ij}) < 0 , an increase in w _{ij} decreases E . The new \Delta w _{ij} is added to the old weight, and the product of the learning rate and the gradient, multiplied by -1 guarantees that w _{ij} changes in a way that always decreases E . In other words, in the equation immediately below, - η (\partial E)/(\partial w _{ij}) always changes w _{ij} in such a way that E is decreased:\Delta w _{ij} = - η (\partial E)/(\partial w _{ij}) = - η o _{i} \delta _{j}

Second-order gradient descent

Using a Hessian matrix of second-order derivatives of the error function, the Levenberg–Marquardt algorithm often converges faster than first-order gradient descent, especially when the topology of the error function is complicated.^{[8] [9]} It may also find solutions in smaller node counts for which other methods might not converge.^[9] The Hessian can be approximated by the Fisher information matrix.^[10]

Loss function

The loss function is a function that maps values of one or more variables onto a real number intuitively representing some "cost" associated with those values. For backpropagation, the loss function calculates the difference between the network output and its expected output, after a training example has propagated through the network.

Assumptions

The mathematical expression of the loss function must fulfill two conditions in order for it to be possibly used in backpropagation.^[11] The first is that it can be written as an average $E=\backslash frac\backslash sum\_xE\_x$ over error functions $E\_x$, for $n$ individual training examples, $x$. The reason for this assumption is that the backpropagation algorithm calculates the gradient of the error function for a single training example, which needs to be generalized to the overall error function. The second assumption is that it can be written as a function of the outputs from the neural network.

Example loss function

Let

y,y' be vectors in R ^{n} .

Select an error function

E(y,y') measuring the difference between two outputs. The standard choice is the square of the Euclidean distance between the vectors y and y' :$$E(y,y\text{'})\; =\; \backslash tfrac\; \backslash lVert\; y-y\text{'}\backslash rVert^2$$The error function over $n$ training examples can then be written as an average of losses over individual examples:$$E=\backslash frac\backslash sum\_x\backslash lVert\; (y(x)-y\text{'}(x))\; \backslash rVert^2$$

Limitations

• Gradient descent with backpropagation is not guaranteed to find the global minimum of the error function, but only a local minimum; also, it has trouble crossing plateaus in the error function landscape. This issue, caused by the non-convexity of error functions in neural networks, was long thought to be a major drawback, but Yann LeCun et al. argue that in many practical problems, it is not.^[12]
• Backpropagation learning does not require normalization of input vectors; however, normalization could improve performance.^[13]
• Backpropagation requires the derivatives of activation functions to be known at network design time.

History

Precursors

Backpropagation had been derived repeatedly, as it is essentially an efficient application of the chain rule (first written down by Gottfried Wilhelm Leibniz in 1676^{[14] [15]}) to neural networks.

The terminology "back-propagating error correction" was introduced in 1962 by Frank Rosenblatt, but he did not know how to implement this.^[16] In any case, he only studied neurons whose outputs were discrete levels, which only had zero derivatives, making backpropagation impossible.

Precursors to backpropagation appeared in optimal control theory since 1950s. Yann LeCun et al credits 1950s work by Pontryagin and others in optimal control theory, especially the adjoint state method, for being a continuous-time version of backpropagation.^[17] Hecht-Nielsen^[18] credits the Robbins–Monro algorithm (1951)^[19] and Arthur Bryson and Yu-Chi Ho's Applied Optimal Control (1969) as presages of backpropagation. Other precursors were Henry J. Kelley 1960, and Arthur E. Bryson (1961). In 1962, Stuart Dreyfus published a simpler derivation based only on the chain rule.^{[20] [21] [22]} In 1973, he adapted parameters of controllers in proportion to error gradients.^[23] Unlike modern backpropagation, these precursors used standard Jacobian matrix calculations from one stage to the previous one, neither addressing direct links across several stages nor potential additional efficiency gains due to network sparsity.^[24]

The ADALINE (1960) learning algorithm was gradient descent with a squared error loss for a single layer. The first multilayer perceptron (MLP) with more than one layer trained by stochastic gradient descent was published in 1967 by Shun'ichi Amari.^[25] The MLP had 5 layers, with 2 learnable layers, and it learned to classify patterns not linearly separable.

Modern backpropagation

Modern backpropagation was first published by Seppo Linnainmaa as "reverse mode of automatic differentiation" (1970)^[26] for discrete connected networks of nested differentiable functions.^{[27] [28] [29]}

In 1982, Paul Werbos applied backpropagation to MLPs in the way that has become standard.^{[30] [31]} Werbos described how he developed backpropagation in an interview. In 1971, during his PhD work, he developed backpropagation to mathematicize Freud's "flow of psychic energy". He faced repeated difficulty in publishing the work, only managing in 1981.^[32]

Around 1982, David E. Rumelhart independently developed^[33] backpropagation and taught the algorithm to others in his research circle. He did not cite previous work as he was unaware of them. He published the algorithm first in a 1985 paper, then in a 1986 Nature paper an experimental analysis of the technique.^[34] These papers became highly cited, contributed to the popularization of backpropagation, and coincided with the resurging research interest in neural networks during the 1980s.^{[35] [36]}

In 1985, the method was also described by David Parker.^{[37] [38]} Yann LeCun proposed an alternative form of backpropagation for neural networks in his PhD thesis in 1987.^[39]

Gradient descent took a considerable amount of time to reach acceptance. Some early objections were: there were no guarantees that gradient descent could reach a global minimum, only local minimum; neurons were "known" by physiologists as making discrete signals (0/1), not continuous ones, and with discrete signals, there is no gradient to take. See the interview with Geoffrey Hinton.

Early successes

Contributing to the acceptance were several applications in training neural networks via backpropagation, sometimes achieving popularity outside the research circles.

In 1987, NETtalk learned to convert English text into pronunciation. Sejnowski tried training it with both backpropagation and Boltzmann machine, but found the backpropagation significantly faster, so he used it for the final NETtalk. The NETtalk program became a popular success, appearing on the Today show.^[40]

In 1989, Dean A. Pomerleau published ALVINN, a neural network trained to drive autonomously using backpropagation.^[41]

The LeNet was published in 1989 to recognize handwritten zip codes.

In 1992, TD-Gammon achieved top human level play in backgammon. It was a reinforcement learning agent with a neural network with two layers, trained by backpropagation.^[42]

In 1993, Eric Wan won an international pattern recognition contest through backpropagation.^{[43] [44]}

After backpropagation

During the 2000s it fell out of favour, but returned in the 2010s, benefiting from cheap, powerful GPU-based computing systems. This has been especially so in speech recognition, machine vision, natural language processing, and language structure learning research (in which it has been used to explain a variety of phenomena related to first^[45] and second language learning.^[46])^[47]

Error backpropagation has been suggested to explain human brain event-related potential (ERP) components like the N400 and P600.^[48]

In 2023, a backpropagation algorithm was implemented on a photonic processor by a team at Stanford University.^[49]

See also

• Artificial neural network
• Neural circuit
• Catastrophic interference
• Ensemble learning
• AdaBoost
• Overfitting
• Neural backpropagation
• Backpropagation through time

Further reading

• Book: Goodfellow . Ian . Ian Goodfellow . Bengio . Yoshua . Yoshua Bengio . Courville . Aaron . 2016 . Deep Learning . MIT Press . 6.5 Back-Propagation and Other Differentiation Algorithms. https://www.deeplearningbook.org/contents/mlp.html#pf25. 200–220. 9780262035613 .
• Book: Nielsen, Michael A. . Michael Nielsen . 2015 . Neural Networks and Deep Learning . How the backpropagation algorithm works . http://neuralnetworksanddeeplearning.com/chap2.html . Determination Press.
• Web site: Neural Network Back-Propagation for Programmers . James . McCaffrey . October 2012 . .
• Book: Rojas, Raúl . https://page.mi.fu-berlin.de/rojas/neural/chapter/K7.pdf . The Backpropagation Algorithm . Neural Networks : A Systematic Introduction . Raúl Rojas . Berlin . Springer . 1996 . 3-540-60505-3 .

External links

• Backpropagation neural network tutorial at the Wikiversity
• Web site: Principles of training multi-layer neural network using backpropagation . Mariusz . Bernacki . Przemysław . Włodarczyk . 2004 .
• Web site: CS231n . 2016 . Stanford University . Andrej . Karpathy . Andrej Karpathy . Lecture 4: Backpropagation, Neural Networks 1 . https://ghostarchive.org/varchive/youtube/20211212/i94OvYb6noo. 2021-12-12 . live. .
• Web site: 3Blue1Brown . What is Backpropagation Really Doing? . November 3, 2017 . https://ghostarchive.org/varchive/youtube/20211212/Ilg3gGewQ5U. 2021-12-12 . live. .
• Web site: Yet Another Derivation of Backpropagation in Matrix Form . Sudeep Raja . Putta . 2022 .

Notes and References

1. Kelley . Henry J. . Henry J. Kelley . 1960 . Gradient theory of optimal flight paths . ARS Journal . 30 . 10 . 947–954 . 10.2514/8.5282.
2. Book: Bryson, Arthur E. . Proceedings of the Harvard Univ. Symposium on digital computers and their applications, 3–6 April 1961 . Harvard University Press . 1962 . Cambridge . A gradient method for optimizing multi-stage allocation processes . 498866871.
3. , "The term back-propagation is often misunderstood as meaning the whole learning algorithm for multilayer neural networks. Backpropagation refers only to the method for computing the gradient, while other algorithms, such as stochastic gradient descent, is used to perform learning using this gradient."
4. , "The back-propagation algorithm described here is only one approach to automatic differentiation. It is a special case of a broader class of techniques called reverse mode accumulation."
5. Ramachandran. Prajit. Zoph. Barret. Le. Quoc V.. 2017-10-27. Searching for Activation Functions. cs.NE. 1710.05941.
6. Misra. Diganta. 2019-08-23. Mish: A Self Regularized Non-Monotonic Activation Function. cs.LG. 1908.08681. en.
7. Rumelhart . David E. . David E. Rumelhart . Hinton . Geoffrey E. . Geoffrey E. Hinton . Ronald J. . Williams . Ronald J. Williams . Learning representations by back-propagating errors. Nature. 1986a. 323. 6088. 533–536. 10.1038/323533a0. 1986Natur.323..533R. 205001834 .
8. Tan. Hong Hui. Lim. King Han. Review of second-order optimization techniques in artificial neural networks backpropagation. IOP Conference Series: Materials Science and Engineering. 2019. 495. 1. 012003. 10.1088/1757-899X/495/1/012003. 2019MS&E..495a2003T. 208124487. free.
9. Improved Computation for Levenberg–Marquardt Training. Wiliamowski. Bogdan. Yu. Hao. IEEE Transactions on Neural Networks and Learning Systems. 21. 6. June 2010.
10. Martens. James. New Insights and Perspectives on the Natural Gradient Method. Journal of Machine Learning Research. 21. August 2020. 1412.1193.
11. , "[W]hat assumptions do we need to make about our cost function ... in order that backpropagation can be applied? The first assumption we need is that the cost function can be written as an average ... over cost functions ... for individual training examples ... The second assumption we make about the cost is that it can be written as a function of the outputs from the neural network ..."
12. Yann . LeCun . Yoshua . Bengio . Geoffrey . Hinton . Deep learning . Nature . 521 . 7553 . 2015 . 436–444 . 10.1038/nature14539 . 26017442. 2015Natur.521..436L . 3074096 .
13. Book: AI Techniques for Game Programming. Buckland. Matt. Collins. Mark . Boston . Premier Press . 2002 . 1-931841-08-X .
14. Book: Leibniz, Gottfried Wilhelm Freiherr von . The Early Mathematical Manuscripts of Leibniz: Translated from the Latin Texts Published by Carl Immanuel Gerhardt with Critical and Historical Notes (Leibniz published the chain rule in a 1676 memoir) . 1920 . Open court publishing Company . 9780598818461 . en.
15. Rodríguez . Omar Hernández . López Fernández . Jorge M. . 2010 . A Semiotic Reflection on the Didactics of the Chain Rule . The Mathematics Enthusiast . 7 . 2 . 321–332 . 10.54870/1551-3440.1191 . 29739148 . 2019-08-04 . free.
16. Book: Rosenblatt, Frank . Principles of Neurodynamics . Spartan, New York . 1962 . 287–298 . Frank Rosenblatt.
17. LeCun, Yann, et al. "A theoretical framework for back-propagation." Proceedings of the 1988 connectionist models summer school. Vol. 1. 1988.
18. Book: Hecht-Nielsen, Robert . Neurocomputing . 1990 . Reading, Mass. : Addison-Wesley Pub. Co. . Internet Archive . 978-0-201-09355-1 . 124–125.
19. Robbins . H. . Herbert Robbins . Monro . S. . 1951 . A Stochastic Approximation Method . The Annals of Mathematical Statistics . 22 . 3 . 400 . 10.1214/aoms/1177729586 . free.
20. Dreyfus . Stuart . 1962 . The numerical solution of variational problems . Journal of Mathematical Analysis and Applications . 5 . 1 . 30–45 . 10.1016/0022-247x(62)90004-5 . free.
21. Dreyfus . Stuart E. . Stuart Dreyfus . 1990 . Artificial Neural Networks, Back Propagation, and the Kelley-Bryson Gradient Procedure . Journal of Guidance, Control, and Dynamics . 13 . 5 . 926–928 . 1990JGCD...13..926D . 10.2514/3.25422.
22. Web site: Mizutani . Eiji . Dreyfus . Stuart . Nishio . Kenichi . July 2000 . On derivation of MLP backpropagation from the Kelley-Bryson optimal-control gradient formula and its application . Proceedings of the IEEE International Joint Conference on Neural Networks.
23. Dreyfus . Stuart . Stuart Dreyfus . 1973 . The computational solution of optimal control problems with time lag . IEEE Transactions on Automatic Control . 18 . 4 . 383–385 . 10.1109/tac.1973.1100330.
24. 2212.11279 . cs.NE . Jürgen . Schmidhuber . Jürgen Schmidhuber . Annotated History of Modern AI and Deep Learning . 2022.
25. Amari . Shun'ichi . Shun'ichi Amari . 1967 . A theory of adaptive pattern classifier . IEEE Transactions . EC . 16 . 279–307.
26. Seppo . Linnainmaa . Seppo Linnainmaa . 1970 . Masters . The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors . fi . University of Helsinki . 6–7.
27. Linnainmaa . Seppo . Seppo Linnainmaa . 1976 . Taylor expansion of the accumulated rounding error . BIT Numerical Mathematics . 16 . 2 . 146–160 . 10.1007/bf01931367 . 122357351.
28. Book: Griewank, Andreas . Optimization Stories . 2012 . Documenta Matematica, Extra Volume ISMP . 389–400 . Who Invented the Reverse Mode of Differentiation? . 15568746.
29. Book: Griewank . Andreas . [{{google books |plainurl=y |id=xoiiLaRxcbEC}} Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, Second Edition ]. Walther . Andrea . Andrea Walther . SIAM . 2008 . 978-0-89871-776-1.
30. Book: Werbos, Paul. System modeling and optimization. Springer. 1982. 762–770. Applications of advances in nonlinear sensitivity analysis. Paul Werbos. http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf. 2 July 2017. 14 April 2016. https://web.archive.org/web/20160414055503/http://werbos.com/Neural/SensitivityIFIPSeptember1981.pdf. live.
31. Book: Werbos, Paul J. . The Roots of Backpropagation : From Ordered Derivatives to Neural Networks and Political Forecasting . New York . John Wiley & Sons . 1994 . 0-471-59897-6 .
32. Book: Talking Nets: An Oral History of Neural Networks . 2000 . The MIT Press . 978-0-262-26715-1 . Anderson . James A. . en . 10.7551/mitpress/6626.003.0016 . Rosenfeld . Edward.
33. Olazaran Rodriguez, Jose Miguel. A historical sociology of neural network research. PhD Dissertation. University of Edinburgh, 1991.
34. Rumelhart . Hinton . Williams . Learning representations by back-propagating errors . Nature . 323 . 6088 . 533–536 . 10.1038/323533a0 . 1986 . 1986Natur.323..533R . 205001834 .
35. Book: Rumelhart . David E. . David E. Rumelhart . James L. . McClelland . James McClelland (psychologist) . Parallel Distributed Processing : Explorations in the Microstructure of Cognition . 1 : Foundations . Rumelhart . David E. . David E. Rumelhart . Hinton . Geoffrey E. . Geoffrey E. Hinton . Ronald J. . Williams . Ronald J. Williams . 8. Learning Internal Representations by Error Propagation . Cambridge . MIT Press . 1986b . 0-262-18120-7 . registration . https://archive.org/details/paralleldistribu00rume .
36. Book: Alpaydin, Ethem. [{{google books |plainurl=y |id=4j9GAQAAIAAJ}} Introduction to Machine Learning]. MIT Press. 2010. 978-0-262-01243-0.
37. Parker . D.B. . 1985 . Learning Logic: Casting the Cortex of the Human Brain in Silicon . Center for Computational Research in Economics and Management Science . Cambridge MA . Technical Report TR-47 . Massachusetts Institute of Technology.
38. Book: Hertz, John . Introduction to the theory of neural computation . 1991 . Addison-Wesley . Krogh, Anders., Palmer, Richard G. . 0-201-50395-6 . Redwood City, Calif. . 8 . 21522159.
39. Modèles connexionnistes de l'apprentissage . Université Pierre et Marie Curie . 1987 . Paris, France . Thèse de doctorat d'état . Yann . Le Cun.
40. Book: Sejnowski, Terrence J. . The deep learning revolution . 2018 . The MIT Press . 978-0-262-03803-4 . Cambridge, Massachusetts London, England.
41. Pomerleau . Dean A. . 1988 . ALVINN: An Autonomous Land Vehicle in a Neural Network . Advances in Neural Information Processing Systems . Morgan-Kaufmann . 1.
42. Book: Sutton . Richard S. . Barto . Andrew G. . Reinforcement Learning: An Introduction . 2nd . MIT Press . Cambridge, MA . 2018 . 11.1 TD-Gammon . http://www.incompleteideas.net/book/11/node2.html.
43. Schmidhuber . Jürgen . Jürgen Schmidhuber . 2015 . Deep learning in neural networks: An overview . Neural Networks . 61 . 85–117 . 1404.7828 . 10.1016/j.neunet.2014.09.003 . 25462637 . 11715509.
44. Book: Wan, Eric A. . Time Series Prediction : Forecasting the Future and Understanding the Past . Addison-Wesley . 1994 . 0-201-62601-2 . Weigend . Andreas S. . Andreas Weigend . Proceedings of the NATO Advanced Research Workshop on Comparative Time Series Analysis . 15 . Reading . 195–217 . Time Series Prediction by Using a Connectionist Network with Internal Delay Lines . Gershenfeld . Neil A. . Neil Gershenfeld . 12652643.
45. Chang. Franklin. Dell. Gary S.. Bock. Kathryn. 2006. Becoming syntactic.. Psychological Review. 113. 2. 234–272. 10.1037/0033-295x.113.2.234. 16637761.
46. Janciauskas. Marius. Chang. Franklin. Input and Age-Dependent Variation in Second Language Learning: A Connectionist Account. Cognitive Science. 42. 519–554. 10.1111/cogs.12519. 28744901. 6001481. 2018. Suppl Suppl 2 .
47. Web site: Decoding the Power of Backpropagation: A Deep Dive into Advanced Neural Network Techniques . janbasktraining.com . 30 January 2024 . en.
48. Fitz. Hartmut. Chang. Franklin. 2019. Language ERPs reflect learning through prediction error propagation. Cognitive Psychology. en. 111. 15–52. 10.1016/j.cogpsych.2019.03.002. 30921626. 21.11116/0000-0003-474D-8. 85501792. free.
49. Web site: Photonic Chips Curb AI Training's Energy Appetite - IEEE Spectrum . 2023-05-25 . . en.