Changes

Jump to navigation Jump to search
47 bytes added ,  12:14, 15 February 2017
no edit summary
It's complexity is listed as: Suppose there are n training samples, m features, k hidden layers, each containing h neurons - for simplicity, and o output neurons. The time complexity of backpropagation is O(n * m * h^k * o * i), where i is the number of iterations. Since backpropagation has a high time complexity, it is advisable to start with smaller number of hidden neurons and few hidden layers for training.
 
****** WE ENDED UP USING THIS ONE ***********

Navigation menu