Neural Network weight selection using Genetic Algorithm

Question

Hi I want to ask about weight selection in neural network using genetic algorithm.

Right now what I understand is

Is it the right thing?

if yes what I'm still not sure are :

If I have 50 chromosome in one population that means I must create 50 neural network?
Let's say I have 100 different input and I want the network to learn it by using weight selection only (not using backpropagation) and how I calculate the error? Testing and calculating the error of every input(using MSE) and divide it by 100?

I think that's all for now

Thank you

deong · Accepted Answer · 2013-01-04 12:07:30Z

2

Your understanding is correct.

Yes, you do create a new neural network for each chromosome (although you're considering the network structure as fixed, so technically you could reuse them by just resetting the weights anew for each chromosome.
For the error, you're on the right track. For a GA, generally only relative differences in fitness are important, so it doesn't really matter if you divide by 100 or not -- that's just linearly scaling the fitness values. That might matter for some choices of genetic operators (e.g., roulette-wheel selection can be sensitive to absolute fitness values), but often it won't matter at all.

answered Jan 4 '13 at 12:07

deong

9965 silver badges4 bronze badges

$\begingroup$ Thank you for the answer, but now I already used roulette-wheel selection, and right now I calculate my fitness with this function (1-error(with MSE)) * 100 will it affected how accurate is the result and how long it'll take to achieve convergence? thank you $\endgroup$ – Niko Adrianus Yuwono Jan 4 '13 at 12:36
$\begingroup$ As a rule of thumb, I'd avoid roulette wheel selection anyway, as it doesn't allow for control of selection pressure very well. By default, I'd assume binary tournament selection to start with and work from there. Adding a constant to each fitness value will change selection probabilities under roulette wheel, but multiplying by a constant doesn't, as can be shown directly by comparing the selection probabilities directly. f_i / \sum_{j=1}^n f_j for the unscaled version versus 100*f_i / \sum_{j=1}^n 100*f_j with your scaling. As the 100 factors out of each term, the two are equivalent. $\endgroup$ – deong Jan 4 '13 at 14:40
$\begingroup$ thank you for your answer! I'll try to use binary tournament selection as you said above :) $\endgroup$ – Niko Adrianus Yuwono Jan 4 '13 at 16:41

add a comment |

migrated from cstheory.stackexchange.com Jan 7 '13 at 15:30