Adding momentum - sigmoid units, Computer Engineering

Assignment Help:

Adding Momentum - Sigmoid units:

However imagine a ball rolling down a hill as it does so then it gains momentum in which its speed increases and it becomes more difficult to stop. Alternatively as it rolls down the hill towards the valley floor as the global minimum, then it might occasionally wander into local hollows. Moreover,, there it may be that the momentum it has obtained stays it rolling up and out of the hollow and back on track to the valley floor. 

Hence the crude analogy describes one heuristic technique for avoiding local minima that called adding momentum, funnily enough. Thus the method is simple as: now for each weight remember as the previous value of Δ that was added on to the weight in the last epoch. Rather then, where updating that weight for the current epoch, add on a little of the previous Δ. Now how small to make the additional extra is controlled through a parameter α that's called the momentum which is set to a value between 0 and 1. 

Alternatively to see why this might help bypass local minima so note there that if the weight change carries on in the direction it was going in the previous epoch and then the movement will be a little much more pronounced in the current epoch. Thus this effect will be compounded as the search continues in the same direction. Where the trend finally reverses so then the search may be at the global minimum case there it is hoped that the momentum won't be enough to take it anywhere other than where it is belongs. Conversely the search may be at a fairly narrow local minimum. So next there in this case, even though the back propagation algorithm which dictates Δ will change direction then it may be that the additional extra from the previous epoch as the momentum may be enough to  counteract this effect for a few steps. Then we can saythese few steps may be all that is utilised to bypass the local minimum.


Related Discussions:- Adding momentum - sigmoid units

Disadvantages of mpi, Disadvantages of MPI  Performance is restric...

Disadvantages of MPI  Performance is restricted by communication network between the nodes It can be harder to debug Needs more programming changes to go from seri

What is race condition, What is Race condition? Race condition: The c...

What is Race condition? Race condition: The circumstances where several processes access - and manipulate shared data-concurrently. The last value of the shared data depends

Meaning of convergence regarding e-commerce, What does the term convergence...

What does the term convergence mean regarding E-commerce? Convergence regarding e-commerce: The capability to leverage and integrate the different data sources and proces

What do you meant by erp, Question 1: What do you meant by ERP? What ar...

Question 1: What do you meant by ERP? What are the benefits of ERP? Definition of ERP Question 2: Describe briefly the advantages of the ERP. Explanation of six advanta

In which page replacement policies balady’s anomaly occurs, In which page r...

In which page replacement policies Balady’s anomaly occurs? FIFO that is First in First Out.

How to fix an asic-based design from easiest to most extreme, How to fix an...

How to fix an ASIC-based design from easiest to most extreme? There are different ways to fix an ASIC-based design as given below: Initially, assume some reviews fundamentally.

Turning machine, procedure of turning machine operation on markov algorithm...

procedure of turning machine operation on markov algorithm

Heuristic search strategies, Heuristic Search Strategies: Generally sp...

Heuristic Search Strategies: Generally speaking that, a heuristic search is one which have uses a rule of thumb to improve an agent's performance in solving the problems via s

Computer systems principles, Your program should print the inverted map to ...

Your program should print the inverted map to the screen (using a format similar to the inverter project, but you will print out the url values instead of document IDs). You can pr

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

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