Back propagation learning routine, Computer Engineering

Back propagation Learning Routine - Aartificial intelligence

As with perceptrons, the information in the network is stored in the weights, so the learning problem comes down to the question: how do we train the weights to best categories the training instance. Then we hope that this representation provides a nice way to categories unseen examples.

In outline, the back propagation method is the similar as for perceptrons:

1. We select and fix our architecture for the network, which will include input, hidden and output units, all of which will include sigmoid functions.

2. We randomly assign the weights between all the nodes. The assignments would be to smaller numbers, typically between -0.5 and 0.5.

3. Each training instance is used, 1 after another, to re-train the weights in the network. The way this is done is given in detail below.

4.   After each epoch (run through all the training examples), a termination situation is examine (also detailed below). For this method, Note down that, we are not guaranteed to search weights which give the network the global minimum error, for example, absolutely right categorization of the training examples. Hence the termination condition can have to be in terms of a (possibly small) number of miscategorisations. We see later that this must not be such a fine idea, though.


Posted Date: 10/2/2012 6:22:46 AM | Location : United States

Related Discussions:- Back propagation learning routine, Assignment Help, Ask Question on Back propagation learning routine, Get Answer, Expert's Help, Back propagation learning routine Discussions

Write discussion on Back propagation learning routine
Your posts are moderated
Related Questions
Handling Interrupts: Precise interrupts (sequential semantics) Complete instructions before the offending instructions o   Force trap instruction into IF o

Explain the significance of init() and destroy( ) methods of an applet? Also explain two ways of invoking an applet. The init( ) method is utilized for fundamental initializati

"Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''a''-''z'') and the ascii values will starts from

What is Parsing? Parsing: It is the process of analyzing a text, made of an order of tokens, to find out its grammatical structure regarding a given formal grammar. Parsing

I need to write a 32 bit adder in MIPS without using the Add command and a divider as well.

Define Memory read and write operation The transfer of information from a memory word to outside environment is known as read operation. The transfer of new information to be k

The output of SR flip flop when S=1, R=0 is ? Ans. When for the SR flip-flop S=set i/p R=reset i/p, as S=1, R=0, Flip-flop will be set means output will be one.

Any identity or equality in Boolean algebra, suchas de Morgan's Theorem can be proved usingthe method of perfect induction. 1. All combinations of variables are written down.

Mathematical Simulation and Modeling Applications The tasks including modeling and mathematical simulation require a lot of parallel processing. Three basic formalisms in model

For the following, cmd1 and cmd2 are arbitrary UNIX commands, and file1 and file2 are files owned by you. Write UNIX (bash) commands to: (a) Run cmd1 and append its output to f