Backpropagation, Computer Engineering

Assignment Help:

Backpropagation:

However Backpropagation can be seen as utilising searching a space of network configurations as weights in order to find a configuration with the least error, measured in the above fashion. Hence the very complicated network structure look like as the error surface that is searched can have local minima so this is a problem for multi-layer networks where we look at ways around it below.

So now having said that, even if a learned network is in a local minima there it may still perform adequately hence multi-layer networks have been utilise to great effect in real world situations as see Tom Mitchell's book for a description of an "ANN" that can drive a car! 

According to the problem of local minima is to utilise random re-start as described in the lecture on search techniques. But different initial random weightings for the network may mean like it converges to different local minima or the best of these can be taken for the learned ANN.

However, as described there in Mitchell's book, a "committee" of networks could be learned that with the as possibly weighted average of their decisions taken as an overall decision for a given test example.


Related Discussions:- Backpropagation

Network for digital methods in the arts and humanities, Network for Digital...

Network for Digital Methods in the Arts and Humanities: Europe has seen a signifi cant investment in the digitisation of its cultural heritage as part of the worldwide establi

What is random access memory, What is Random access memory (RAM) This i...

What is Random access memory (RAM) This is a volatile memory (i.e. contents are lost when computer is switched off). A user can write or delete data and read the contents. Befo

Explain pipelining, Define pipelining Pipelining is an efficient way of...

Define pipelining Pipelining is an efficient way of organizing concurrent activity in a computer system. The processor implements the program by fetching and implementing instr

Explain the boolean equations for logic circuits, Explain The Boolean Equat...

Explain The Boolean Equations for Logic Circuits? A Boolean equation is the mathematical representation of a logic circuit using standard Boolean terms. All the logic gates (AND,

What is the semiconductor memory chip, What is the Semiconductor memory chi...

What is the Semiconductor memory chip A semiconductor memory chip comprises a large number of cells organized into an array and the logic necessary to access any array in the c

Evaluation functions, Evaluation Functions: Evaluation functions calcu...

Evaluation Functions: Evaluation functions calculate approximately the score which can be prove of guaranteed if a particular world state is reached. Same like in chess, evalu

Recursion to an iterative procedure, The data structure required to convert...

The data structure required to convert a recursion to an iterative procedure is  Stack is the data structure required to convert a recursion to an iterative procedure

Html, discuss hypertext mark up language

discuss hypertext mark up language

Show the process of message passing, Q. Show the process of message passing...

Q. Show the process of message passing? The subsequent issues are determined by system in process of message passing: 1)  Whether receiver is prepared to receive message

Kirchoff''s laws, i want to make an assignment about kirchoff''s law

i want to make an assignment about kirchoff''s law

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd