Started a blog on https://t.co/972rmJ8WX8. Imported 3 posts from Medium + just finished 1 consolidating @FakePsyho's tips from https://t.co/jTO0Z2ngqj. Enjoy!
Let's make a silly experiment.
For every like this post receives in the next 24 hours, I will post one tip for heuristic/bot programming contests.
I will start posting these as a thread in ~1h from now.
I could talk about those things for days, so bring it on!
@unixpickle If you'd like to try more cards, you could probably exclude those expensive black cards.
Another thought: pro agent (when being a judge) would try to avoid awarding a point to his biggest rival in terms of points (faking that somebody else was the funniest).
@unixpickle Interesting. Perhaps varying the number of white cards could also shed more light; more cards, more expressive (...to some saturation point?). Wiki mentions 10, the code uses 7.
@DaveChurchill It can, it's easy to do some compiler optimization slightly differently, impacting the time when testing with one particular code. Another example: https://t.co/ug9euaxbnP
@unixpickle Great, congrats! What's happening on the floor 20, some new obstacle? Do you know why your approach can't handle that? Do you have some ideas how to improve it?
@jonasschneider What behaviors are scripted?
What would you do differently if you could redo Five?
What were the most surprising things during its development?
What are the plans for the future?
Exciting work, well done :)
We are proud to announce the 2019 edition of EEML summer school, 1-6 July, Bucharest, Romania. Topics covered: DL, RL, computer vision, bayesian learning, medical imaging, and NLP. An amazing set of speakers confirmed so far! More info coming soon! Check https://t.co/PM3Tn3ox4Y!
@woj_zaremba I'd say yes, if backprop would have the same exploration as evolutionary algorithms. They are very similar to backprop / gradient methods, population follows the gradient without explicitly calculating it.