Genetic Algorithms - Jeremy Fisher

[@Not.So.WiseGuy]

Great talk. It felt weird when there was just silence after any of the jokes.

[@stevecook9123]

For the question at 37:00 - The local optima problem is mostly addressed in GA with the mutation. The best mutation methods and factors help in "jumping out" of local optima.

[@ldandco]

From 4:58 to 5:40 I was looking for a simple explanation on GA. That was it. Simple Most other explanations I've found over complicate things and make it feel like the foundation is more difficult than what it is

[@distrologic2925]

What I am often missing in disscussions about genetic algorithms is the link to biology. Because what GAs do is harnessing darwinistic and evolutionary principles (obviously). I think there is a lot more from biology that can be applied to GAs, for example how the competition between solutions actually affects the selection and how heavier mutation or larger populations affect the generated solutions. Also I feel like neural networks and genetic algorithms are the perfect fit for AI. One could use a genetic algorithm to evolve a neural network or have a neural network optimize a genetic algorithm by learning what mutations make the solutions score better. So basically a learning genetic algorithm.

[@gdolphy]

Langkopf Kopf : Yes, like how we are now able to alter our own evolution to some degree.

[@distrologic2925]

what do you mean?

[@hansu7474]

"how the competition between solutions actually affects the selection" I think this is just a fitness function. It is very hard to mimick natural selection in nature because there are very many moving parts, as well as there are no directions in evolution. So they use a fitness function, which is kind of an 'artificial selection'. "how heavier mutation or larger populations affect the generated solutions." I think there are entire set of papers devoted in genetic algorithm optimizations. I never read them before, but I can only assume that they optimise various parameters such as mutation or crossover.

[@distrologic2925]

possibly.. so the question may be: what is the fitness function in the real world? and since everybody is basically trying to figure that out all of the time, it is definitely not a simple question. But that might show, that the genetic algorithm will only ever find solutions as good as the fitness function is, eg as close as the fitness function is to your real world application. And as that can be incredibly complex, it may be a better start to simulate the real world environment as accurately as possible (real world environment must not necessarily mean the physical outside world in all of its depth and space, but can also be a simple space as a factory or a virtual space like a computer network) and then just let the simulation be the fitness function.

[@sampadmohanty8573]

That is exactly what NEAT does. Neural Evolution of Augmented Typologies.

[@jomilojuodeyemi8300]

best talk/ tutorial i've encountered on the subject. I was stuck on the subject of encoding until this video.

[@gdolphy]

So far the GA and neural methods don't really mimick so much. One missing component is a morpholagicl neural network. Not only do the weights change but the connections too. The neurons should be input^input And connections (input!/input). Also on the out put methods remove any if statements and recode such that the neurons have full control of the out put.

[@patmull1]

Wow. This was really great. I like those nice visuals and color representations!

[@pyb.5672]

This feels like a practice in front of the speaker's cat instead of the actual presentation.

[@DasAntiNaziBroetchen]

Wtf is wrong with the dude at 44:00 waving the microphone around while talking?? I can't hear SHIT!

[@TheHpsh]

just wonder, has anyone tried to do something like the traveling salesman problem, with a genetic algorithm without crossover, in my head it would make more sense

[@georgechristoforou991]

you mean just mutation?

[@distrologic2925]

You need crossover to exploit your population. If you dont crossover you can just aswell mutate one solution until you get it right. With crossover you get to combine the best solutions and converge a lot faster.

[@TheHpsh]

@@georgechristoforou991 no, it still need a selection algorithm to, the problem is in the salesman problem is are the city something that would be like a gene, or would it be more like a basepair, my view is it like a base pair, and the list of cities would be a single gene

[@TheHpsh]

@@distrologic2925 bacterias work without crossover, I think you could do a form of crossover, but the problem in the salesman problem is what is really the gene, and I think the whole list would be a single gene, but typically a single place would be looked at as a gene.

[@distrologic2925]

@@TheHpsh kzbin.info/www/bejne/p2fJgZ5mYpKYfrs or look for "traveling salesman problem, four algorithms" there is also something called Simulated Annealing being tested there, im sure you will find it interesting.