35 ms·
We only know which ones are spurious if we run the trimming algorithms. I wrote a paper about 10 years ago showing how to use generic algorithms on the weight m
by rdlecler1 9y ago
We only know which ones are spurious if we run the trimming algorithms. I wrote a paper about 10 years ago showing how to use generic algorithms on the weight matrix to remove spurious interactions.
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2538912/ https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2538912/
- deleted 9y ago[deleted]
- DonaldFisk 9y agoGenetic algorithms?
- rdlecler1 9y agoYes, sorry. Typo.
- kazinator 9y agoDo we know which ones are absolutely spurious? Or do we just know which ones are spurious with respect to a particular result that we got? Like for this image of Grandma, these cells are recognizing it, so the others are spurious. Oops, for this other image of Grandma, a different subset are recognizing it. If, say, the same 90% of the structure is not involved in recognizing any instances, then why wouldn't we have made the whole thing 10X smaller in the first place and trained that much smaller network? Or why don't we make it 10X smaller now? Trim away the dead weight and make it lighter and faster.
- rdlecler1 9y agoThat’s what the genetic algorithm is for. You essentially add a entropy function that trims connections. If the performance is neutral or improves then the leaner network topology is subject to positive selection in a population.