aothman

8 ms·

1. 31.▲
   by aothman 16y ago

   For solving local search problems, I use tabu search (hill climb with a "recently visited" list) or beam search (simultaneous hill search). Both are simple techniques that show remarkable emergent behavior. Many search problems are better p
2. 32.▲
   by aothman 16y ago

   GAs are just a really complex version of a local search algorithm. The problem with them is that they're just too complicated - you're trying to solve some non-linear problem, and your first step is to introduce several more non-linear prob
3. 33.▲
   by aothman 16y ago

   NB: This article (and several more like it) was in January's wired. As an AI researcher, I get suspicious when I see anyone talking about Genetic Algorithms and Neural Nets. These are techniques that current researchers simply do not use (N
4. 34.▲
   by aothman 16y ago

   Sounds like he was in the right place at the right time. I think it would be a mistake to read anything into his story other than "be really lucky". EDIT: There were lots of people just like him that weren't crazy-successful. It's wonderful
5. 35.▲
   by aothman 16y ago

   A lot of this has to do with the way we "score" forecasts. Applying some kind of uniform weighting over forecasts is the natural, and wrong, way to think about things. Nassim Nicholas Taleb (black swan, fooled by randomness) has written abo
6. 36.▲
   by aothman 16y ago

   http://www.youtube.com/watch?v=I6IQ_FOCE6I Just a couple years too early...