Presentation is loading. Please wait.

Presentation is loading. Please wait.

November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 1 Learning in the BPN Gradients of two-dimensional functions:

Published byJane Doreen Leonard Modified over 9 years ago

Similar presentations

Presentation on theme: "November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 1 Learning in the BPN Gradients of two-dimensional functions:"— Presentation transcript:

1 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 1 Learning in the BPN Gradients of two-dimensional functions: The two-dimensional function in the left diagram is represented by contour lines in the right diagram, where arrows indicate the gradient of the function at different locations. Obviously, the gradient is always pointing in the direction of the steepest increase of the function. In order to find the function’s minimum, we should always move against the gradient.

2 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 2 Learning in the BPN In the BPN, learning is performed as follows: 1.Randomly select a vector pair (x p, y p ) from the training set and call it (x, y). 2.Use x as input to the BPN and successively compute the outputs of all neurons in the network (bottom-up) until you get the network output o. 3.Compute the error  o pk, for the pattern p across all K output layer units by using the formula:

3 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 3 Learning in the BPN 4.Compute the error  h pj, for all J hidden layer units by using the formula: 5.Update the connection-weight values to the hidden layer by using the following equation:

4 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 4 Learning in the BPN Repeat steps 1 to 6 for all vector pairs in the training set; this is called a training epoch. Run as many epochs as required to reduce the network error E to fall below a threshold  : 6.Update the connection-weight values to the output layer by using the following equation:

5 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 5 Sigmoidal Neurons In backpropagation networks, we typically choose  = 1 and  = 0. 1 0 1 f i (net i (t)) net i (t)  = 1  = 0.1

6 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 6 Sigmoidal Neurons In order to derive a more efficient and straightforward learning algorithm, let us use a simplified form of the sigmoid function. We do not need a modifiable threshold  ; instead, let us set  = 0 and add an offset (“dummy”) input for each neuron that always provides an input value of 1. Then modifying the weight for the offset input will work just like varying the threshold. The choice  = 1 works well in most situations and results in a very simple derivative of S(net):

7 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 7 Sigmoidal Neurons Very simple and efficient to compute!

8 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 8 Learning in the BPN Then the derivative of our sigmoid function, for example, f’(net k ) for the output neurons, is:

9 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 9 Learning in the BPN Now our BPN is ready to go! If we choose the type and number of neurons in our network appropriately, after training the network should show the following behavior: If we input any of the training vectors, the network should yield the expected output vector (with some margin of error). If we input any of the training vectors, the network should yield the expected output vector (with some margin of error). If we input a vector that the network has never “seen” before, it should be able to generalize and yield a plausible output vector based on its knowledge about similar input vectors. If we input a vector that the network has never “seen” before, it should be able to generalize and yield a plausible output vector based on its knowledge about similar input vectors.

10 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 10 Backpropagation Network Variants The standard BPN network is well-suited for learning static functions, that is, functions whose output depends only on the current input. For many applications, however, we need functions whose output changes depending on previous inputs (for example, think of a deterministic finite automaton). Obviously, pure feedforward networks are unable to achieve such a computation. Only recurrent neural networks (RNNs) can overcome this problem. A well-known recurrent version of the BPN is the Elman Network.

11 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 11 The Elman Network In comparison to the BPN, the Elman Network has an extra set of input units, so-called context units. These neurons do not receive input from outside the network, but from the network’s hidden layer in a one-to-one fashion. Basically, the context units contain a copy of the network’s internal state at the previous time step. The context units feed into the hidden layer just like the other input units do, so the network is able to compute a function that not only depends on the current input, but also on the network’s internal state (which is determined by previous inputs).

12 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 12 The Elman Network

13 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 13 The Counterpropagation Network Another variant of the BPN is the counterpropagation network (CPN). Although this network uses linear neurons, it can learn nonlinear functions by means of a hidden layer of competitive units. Moreover, the network is able to learn a function and its inverse at the same time. However, to simplify things, we will only consider the feedforward mechanism of the CPN.

14 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 14 The Counterpropagation Network A simple CPN network with two input neurons, three hidden neurons, and two output neurons can be described as follows: X1X1X1X1 X2X2X2X2 Input layer H1H1H1H1 H2H2H2H2 H3H3H3H3 Hidden layer Y1Y1Y1Y1 Y2Y2Y2Y2 Output layer

15 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 15 The Counterpropagation Network The CPN learning process (general form for n input units and m output units): 1.Randomly select a vector pair (x, y) from the training set. 2.Normalize (shrink/expand to “length” 1) the input vector x by dividing every component of x by the magnitude ||x||, where

16 November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 16 The Counterpropagation Network 3.Initialize the input neurons with the normalized vector and compute the activation of the linear hidden-layer units. 4.In the hidden (competitive) layer, determine the unit W with the largest activation (the winner). 5.Adjust the connection weights between W and all N input-layer units according to the formula: 6.Repeat steps 1 to 5 until all training patterns have been processed once.

Download ppt "November 21, 2012Introduction to Artificial Intelligence Lecture 16: Neural Network Paradigms III 1 Learning in the BPN Gradients of two-dimensional functions:"

Similar presentations

Artificial Neural Networks

Artificial Neural Networks
CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 7: Learning in recurrent networks Geoffrey Hinton.

CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 7: Learning in recurrent networks Geoffrey Hinton.
Kostas Kontogiannis E&CE

Kostas Kontogiannis E&CE
Machine Learning Neural Networks

Machine Learning Neural Networks
Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.

Pattern Classification All materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley.
Radial Basis Functions

Radial Basis Functions
November 19, 2009Introduction to Cognitive Science Lecture 20: Artificial Neural Networks I 1 Artificial Neural Network (ANN) Paradigms Overview: The Backpropagation.

November 19, 2009Introduction to Cognitive Science Lecture 20: Artificial Neural Networks I 1 Artificial Neural Network (ANN) Paradigms Overview: The Backpropagation.
1 Chapter 11 Neural Networks. 2 Chapter 11 Contents (1) l Biological Neurons l Artificial Neurons l Perceptrons l Multilayer Neural Networks l Backpropagation.

1 Chapter 11 Neural Networks. 2 Chapter 11 Contents (1) l Biological Neurons l Artificial Neurons l Perceptrons l Multilayer Neural Networks l Backpropagation.
September 30, 2010Neural Networks Lecture 8: Backpropagation Learning 1 Sigmoidal Neurons In backpropagation networks, we typically choose  = 1 and 

September 30, 2010Neural Networks Lecture 8: Backpropagation Learning 1 Sigmoidal Neurons In backpropagation networks, we typically choose  = 1 and 
November 9, 2010Neural Networks Lecture 16: Counterpropagation 1 Unsupervised Learning So far, we have only looked at supervised learning, in which an.

November 9, 2010Neural Networks Lecture 16: Counterpropagation 1 Unsupervised Learning So far, we have only looked at supervised learning, in which an.
September 14, 2010Neural Networks Lecture 3: Models of Neurons and Neural Networks 1 Visual Illusions demonstrate how we perceive an “interpreted version”

September 14, 2010Neural Networks Lecture 3: Models of Neurons and Neural Networks 1 Visual Illusions demonstrate how we perceive an “interpreted version”
September 16, 2010Neural Networks Lecture 4: Models of Neurons and Neural Networks 1 Capabilities of Threshold Neurons By choosing appropriate weights.

September 16, 2010Neural Networks Lecture 4: Models of Neurons and Neural Networks 1 Capabilities of Threshold Neurons By choosing appropriate weights.
November 2, 2010Neural Networks Lecture 14: Radial Basis Functions 1 Cascade Correlation Weights to each new hidden node are trained to maximize the covariance.

November 2, 2010Neural Networks Lecture 14: Radial Basis Functions 1 Cascade Correlation Weights to each new hidden node are trained to maximize the covariance.
Chapter 6: Multilayer Neural Networks

Chapter 6: Multilayer Neural Networks
November 30, 2010Neural Networks Lecture 20: Interpolative Associative Memory 1 Associative Networks Associative networks are able to store a set of patterns.

November 30, 2010Neural Networks Lecture 20: Interpolative Associative Memory 1 Associative Networks Associative networks are able to store a set of patterns.
September 23, 2010Neural Networks Lecture 6: Perceptron Learning 1 Refresher: Perceptron Training Algorithm Algorithm Perceptron; Start with a randomly.

September 23, 2010Neural Networks Lecture 6: Perceptron Learning 1 Refresher: Perceptron Training Algorithm Algorithm Perceptron; Start with a randomly.
October 14, 2010Neural Networks Lecture 12: Backpropagation Examples 1 Example I: Predicting the Weather We decide (or experimentally determine) to use.

October 14, 2010Neural Networks Lecture 12: Backpropagation Examples 1 Example I: Predicting the Weather We decide (or experimentally determine) to use.
An Introduction To The Backpropagation Algorithm Who gets the credit?

An Introduction To The Backpropagation Algorithm Who gets the credit?
November 24, 2009Introduction to Cognitive Science Lecture 21: Self-Organizing Maps 1 Self-Organizing Maps (Kohonen Maps) In the BPN, we used supervised.

November 24, 2009Introduction to Cognitive Science Lecture 21: Self-Organizing Maps 1 Self-Organizing Maps (Kohonen Maps) In the BPN, we used supervised.
October 28, 2010Neural Networks Lecture 13: Adaptive Networks 1 Adaptive Networks As you know, there is no equation that would tell you the ideal number.

October 28, 2010Neural Networks Lecture 13: Adaptive Networks 1 Adaptive Networks As you know, there is no equation that would tell you the ideal number.

Similar presentations

Ads by Google