Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Show HN: A Genetic Algorithm library written in JavaScript

github.com

Post reply on HN
Print view View original

21–30 of 42 posts

Re: Show HN: A Genetic Algorithm library written in JavaScript

#21

Post by kvonhorn »

bmh100 wrote: post #16
kvonhorn wrote: post #15

Are genetic algorithms getting popular again? This was the topic of my senior project 20 years ago. I had barely heard about them since I left university, but all of a sudden within the last six months I'm hearing about them again.

Where are you hearing about them? I haven't personally seen an increase in popularity, but that's not saying much.

Mostly links here on HN, links at /r/genetic_algorithms hitting my feed a little more often, and I'm seeing GAs referenced with designing neural nets in random articles.

I'm guessing that it's the last one that would drive renewed interest if that is indeed what I've been seeing, though I'm wondering if there is interest in applications for GAs outside of AI/ML.

Re: Show HN: A Genetic Algorithm library written in JavaScript

#22

Post by djaque »

kvonhorn wrote: post #15

Are genetic algorithms getting popular again? This was the topic of my senior project 20 years ago. I had barely heard about them since I left university, but all of a sudden within the last six months I'm hearing about them again.

They've been quite popular in my field for the past decade and I am doing some work on them right now.

Re: Show HN: A Genetic Algorithm library written in JavaScript

#23

Post by djaque »

tlarkworthy wrote: post #8

Nueral network tech went through a weird period and then back to basics (back prop) just with massive computation (and simple activation functions) with fabulous results. I wonder if similar things could be done with other old school techniques like GA. Does anyone know if we have tried massive ones?

What do you mean a massive GA? Just using a huge population? The issue is that in a GA, time is dominated by evaluation of the fitness function. For my applications every time you do that takes ten minutes. More individuals just means more cost. Plus now there are more of them randomly searching or doing the same thing as each other. So in a sense there is a "too big".

Re: Show HN: A Genetic Algorithm library written in JavaScript

#24

Post by thephyber »

kvonhorn wrote: post #21
bmh100 wrote: post #16

Earlier quoted context omitted.

Where are you hearing about them? I haven't personally seen an increase in popularity, but that's not saying much.

Mostly links here on HN, links at /r/genetic_algorithms hitting my feed a little more often, and I'm seeing GAs referenced with designing neural nets in random articles. I'm guessing that it's the last one that would drive renewed interest if that is indeed what I've been seeing, though I'm wondering if there is interest in applications for GAs outside of AI/ML.

I believe AutoCAD implemented a service which uses a GA to design an optimal solution for desired engineering specs.

At their core, GAs are search algorithms so they are relevant in lots of fields. Combine them with digital simulations (eg. physics, games, war) and you can search at far faster than life speeds.

Re: Show HN: A Genetic Algorithm library written in JavaScript

#25

Post by kvonhorn »

djaque wrote: post #22
kvonhorn wrote: post #15

Are genetic algorithms getting popular again? This was the topic of my senior project 20 years ago. I had barely heard about them since I left university, but all of a sudden within the last six months I'm hearing about them again.

They've been quite popular in my field for the past decade and I am doing some work on them right now.

What field are you in?

Re: Show HN: A Genetic Algorithm library written in JavaScript

#26

Post by bmh100 »

nyxyn wrote: post #19
bmh100 wrote: post #14

I like the cleanliness of the library. I learned about and used GAs in college. It is important for this library to have the ability to hold out the fittest candidate so far. This avoids the situation where a good solution is lost because the population evolves away from it. Optionally, the best candidate can be retained for breeding. Deleting unfit solutions should be a parameter. Breeding partner selection should a…

Thanks for your comment. This algorithm keeps the best candidates through every generation.

I see that, but the best candidate of the current generation is not necessarily the best candidate ever seen. Reproduction and mutation can lead to the best solution of a given generation being worse than the generation before it.

Re: Show HN: A Genetic Algorithm library written in JavaScript

#27

Post by bmh100 »

djaque wrote: post #20
bmh100 wrote: post #14

I like the cleanliness of the library. I learned about and used GAs in college. It is important for this library to have the ability to hold out the fittest candidate so far. This avoids the situation where a good solution is lost because the population evolves away from it. Optionally, the best candidate can be retained for breeding. Deleting unfit solutions should be a parameter. Breeding partner selection should a…

The idea of choosing partners based on fitness is implemented in most GAs. It's called selection and a basic form looks like choosing two individuals for each parent and only breeding the fittest in each pair (tournament selection). Many frameworks also include a "hall of fame" to avoid evolving away from a good point like you mentioned.

The type of selection I was talking about is called "fitness proportionate selection"[1]. I prefer it, mainly because I am more familiar with it.

[1]: https://en.wikipedia.org/wiki/Fitness_proportionate_selectio...

Re: Show HN: A Genetic Algorithm library written in JavaScript

#28

Post by djaque »

kvonhorn wrote: post #25
djaque wrote: post #22

Earlier quoted context omitted.

They've been quite popular in my field for the past decade and I am doing some work on them right now.

What field are you in?

Particle accelerator physics. They are used in the optimization of charged particle optics.

Re: Show HN: A Genetic Algorithm library written in JavaScript

#29

Post by bmh100 »

djaque wrote: post #20
bmh100 wrote: post #14

I like the cleanliness of the library. I learned about and used GAs in college. It is important for this library to have the ability to hold out the fittest candidate so far. This avoids the situation where a good solution is lost because the population evolves away from it. Optionally, the best candidate can be retained for breeding. Deleting unfit solutions should be a parameter. Breeding partner selection should a…

The idea of choosing partners based on fitness is implemented in most GAs. It's called selection and a basic form looks like choosing two individuals for each parent and only breeding the fittest in each pair (tournament selection). Many frameworks also include a "hall of fame" to avoid evolving away from a good point like you mentioned.

What do you recommend as good GA frameworks?

Re: Show HN: A Genetic Algorithm library written in JavaScript

#30

Post by djaque »

bmh100 wrote: post #29
djaque wrote: post #20

Earlier quoted context omitted.

The idea of choosing partners based on fitness is implemented in most GAs. It's called selection and a basic form looks like choosing two individuals for each parent and only breeding the fittest in each pair (tournament selection). Many frameworks also include a "hall of fame" to avoid evolving away from a good point like you mentioned.

What do you recommend as good GA frameworks?

DEAP is the well known framework in python.
Post reply on HN