Nagata–Smirnov metrization theorem

From formulasearchengine
Revision as of 07:00, 6 May 2013 by en>EmausBot (Bot: Migrating 3 interwiki links, now provided by Wikidata on d:Q2621667)
Jump to navigation Jump to search

Template:Multiple issues

In machine learning, the delta rule is a gradient descent learning rule for updating the weights of the inputs to artificial neurons in single-layer neural network.[1] It is a special case of the more general backpropagation algorithm. For a neuron j with activation function g(x), the delta rule for j's ith weight wji is given by

Δwji=α(tjyj)g(hj)xi,

where

α is a small constant called learning rate
g(x) is the neuron's activation function
tj is the target output
hj is the weighted sum of the neuron's inputs
yj is the actual output
xi is the ith input.

It holds that hj=xiwji and yj=g(hj).

The delta rule is commonly stated in simplified form for a neuron with a linear activation function as

Δwji=α(tjyj)xi

It should be noted that while the delta rule is similar to the perceptron's update rule, the derivation is different. The perceptron uses the Heaviside step function as the activation function g(h), and that means that g(h) does not exist at zero, and is equal to zero elsewhere, which makes the direct application of the delta rule impossible.

Derivation of the delta rule

The delta rule is derived by attempting to minimize the error in the output of the neural network through gradient descent. The error for a neural network with j outputs can be measured as

E=j12(tjyj)2.

In this case, we wish to move through "weight space" of the neuron (the space of all possible values of all of the neuron's weights) in proportion to the gradient of the error function with respect to each weight. In order to do that, we calculate the partial derivative of the error with respect to each weight. For the ith weight, this derivative can be written as

Ewji.

Because we are only concerning ourselves with the jth neuron, we can substitute the error formula above while omitting the summation:

Ewji=(12(tjyj)2)wji

Next we use the chain rule to split this into two derivatives:

=(12(tjyj)2)yjyjwji

To find the left derivative, we simply apply the general power rule:

=(tjyj)yjwji

To find the right derivative, we again apply the chain rule, this time differentiating with respect to the total input to j, hj:

=(tjyj)yjhjhjwji

Note that the output of the neuron yj is just the neuron's activation function g applied to the neuron's input hj. We can therefore write the derivative of yj with respect to hj simply as g's first derivative:

=(tjyj)g(hj)hjwji

Next we rewrite hj in the last term as the sum over all k weights of each weight wjk times its corresponding input xk:

=(tjyj)g(hj)(kxkwjk)wji

Because we are only concerned with the ith weight, the only term of the summation that is relevant is xiwji. Clearly,

xiwjiwji=xi,

giving us our final equation for the gradient:

Ewji=(tjyj)g(hj)xi

As noted above, gradient descent tells us that our change for each weight should be proportional to the gradient. Choosing a proportionality constant α and eliminating the minus sign to enable us to move the weight in the negative direction of the gradient to minimize error, we arrive at our target equation:

Δwji=α(tjyj)g(hj)xi.

See also

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

de:LMS-Algorithmus