3 ms·
Sure but if you randomly initialize weights you can keep shuffling the initial state to discover new local maxima. Baking in an informed starting state biases t
by teaearlgraycold 2y ago
Sure but if you randomly initialize weights you can keep shuffling the initial state to discover new local maxima. Baking in an informed starting state biases the results and requires a new biased start if you wish to explore other areas of the gradient. Basically, the student seems to have a reasonable approach. So how does the lesson follow from the preceding paragraph?
- holowoodman 2y agoEven randomness isn't unbiased. A random distribution will have local minima and maxima, just not in all the same places in the next try.
- skybrian 2y agoI think it's ambiguous because tic-tac-toe is a solved problem, so presumably it's being done as an exercise to learn something about neural nets. If the idea were to write an AI to win at a harder game, it would make more sense to add whatever biases you can. You might get better performance that way. Or maybe that's what they thought back when that story was written? Game AI was nothing like we think about it now.