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

Minimis logic function using K-map, Minimise the logic function F (A, B, C,...

Minimise the logic function F (A, B, C, D) = Π M (1, 2, 3, 8, 9, 10, 11,14) ⋅ d (7, 15) Use Karnaugh map.   Ans. Given function F=∏M(1,2,3,8,9,10,11,14).d(7, 15) F'=B'D+B'C+AC+AB'

Replacement policy - cache memories , Replacement policy: On a particul...

Replacement policy: On a particular cache miss we require to evict a line to build room for the new line "In an A-way set associative cache, we have A option of which block

The average quiz score for every student, Make a spreadsheet that has on ev...

Make a spreadsheet that has on every line an integer student identification number followed by 3 quiz grades for that student.  Go though that information from the spreadsheet into

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

Gantt chart, The Gantt chart shows the several activities of each processor...

The Gantt chart shows the several activities of each processor with respect to progress in time in idle-overhead -busy modes with respect to each processor. Kiviat diagram:  Th

What is the advantage of buffering, What is the advantage of buffering? Is ...

What is the advantage of buffering? Is buffering always effective? Justify your answer with help of an example. I/O buffer: One type of input-output requirement arises from d

.bus, clasification of bus

clasification of bus

What is a path name, What is a path name?  A pathname is the path from ...

What is a path name?  A pathname is the path from the root by all subdirectories to a specified file. In a two-level directory structure a user name and a file name describe a

Define access time for magnetic disk, Define access time for magnetic disk....

Define access time for magnetic disk. The sum of seek time and rotational delay is known as access time for disks. Normal 0 false false false EN-IN

Describe the architecture of electronic data exchange, Describe the Electro...

Describe the Electronic Data Exchange (EDI) architecture in brief. Electronic Data Interchange (EDI) may be generally easy to understand as the replacement of paper-based purch

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