Groups keyboard shortcuts have been updated
Dismiss
See shortcuts
Game Benchmark Competition @ GECCO 2021
25 views
Skip to first unread message
Vanessa Volz
Mar 20, 2021, 1:57:30 PM3/20/21
to benchmarking-network
Game Benchmark Competition @ GECCO 2021
Participate in our competition, it’s a WIN-WIN situation
Why?
• Participants match up with other researchers who think they have the best optimisation algorithm available
• Organisers collect data from test suites to further improve the benchmark and push real-world benchmarking a step forward
And there are more reasons: Games are a very interesting topic that motivates a lot of research and have repeatedly been suggested as testbeds for AI algorithms. Key features of games are controllability, safety and repeatability. Moreover, they also feature the ability to simulate properties of real-world problems such as measurement noise, uncertainty and the existence of multiple objectives.
A popular topic within the area are game optimisation problems, where the task is to find solutions representing game content that optimise a given objective function. That’s why we compiled the Game Benchmark for Evolutionary Algorithms (GBEA) from problems like these, which provides you with the chance to try your algorithm in a real-world-like scenario.
PLUS: You can publish your work in the GECCO Companion, either as a competition paper or as a BBOB workshop paper (deadline April 12, 2021).
What?
What is the competition about?
• Single and bi-objective suites from two interesting games
• Continuous and integer search spaces, type depending on game
=> 2 x 2 = 4 combinations (tracks) all together
You are of course free to choose one or multiple tracks that interest you most!
What exactly is a contribution? What do you need to submit?
• COCO Logs
Yep, we use COCO (https://github.com/ttusar/coco-gbea) to compare results.
GBEA is integrated in COCO as four stand-alone problem suites.
This allows for an easy comparison of algorithms.
• Access to the code
We would like access (link to a repository, the code sent, or at least a description of it) to reproduce or at least retrace the results to determine the winner.
How?
It’s easy, just follow the instructions provided at
http://www.gm.fh-koeln.de/~naujoks/gbea/gamesbench_gecco21comp.html
When?
Submission deadline: 19. June 2021
Winner announcement: 10. July 2021
Who?
Participation is free for everybody. The competition is organised by
Tea Tušar, tea....@ijs.si
Vanessa Volz, van...@modl.ai
Boris Naujoks, boris....@th-koeln.de
Participate in our competition, it’s a WIN-WIN situation
Why?
• Participants match up with other researchers who think they have the best optimisation algorithm available
• Organisers collect data from test suites to further improve the benchmark and push real-world benchmarking a step forward
And there are more reasons: Games are a very interesting topic that motivates a lot of research and have repeatedly been suggested as testbeds for AI algorithms. Key features of games are controllability, safety and repeatability. Moreover, they also feature the ability to simulate properties of real-world problems such as measurement noise, uncertainty and the existence of multiple objectives.
A popular topic within the area are game optimisation problems, where the task is to find solutions representing game content that optimise a given objective function. That’s why we compiled the Game Benchmark for Evolutionary Algorithms (GBEA) from problems like these, which provides you with the chance to try your algorithm in a real-world-like scenario.
PLUS: You can publish your work in the GECCO Companion, either as a competition paper or as a BBOB workshop paper (deadline April 12, 2021).
What?
What is the competition about?
• Single and bi-objective suites from two interesting games
• Continuous and integer search spaces, type depending on game
=> 2 x 2 = 4 combinations (tracks) all together
You are of course free to choose one or multiple tracks that interest you most!
What exactly is a contribution? What do you need to submit?
• COCO Logs
Yep, we use COCO (https://github.com/ttusar/coco-gbea) to compare results.
GBEA is integrated in COCO as four stand-alone problem suites.
This allows for an easy comparison of algorithms.
• Access to the code
We would like access (link to a repository, the code sent, or at least a description of it) to reproduce or at least retrace the results to determine the winner.
How?
It’s easy, just follow the instructions provided at
http://www.gm.fh-koeln.de/~naujoks/gbea/gamesbench_gecco21comp.html
When?
Submission deadline: 19. June 2021
Winner announcement: 10. July 2021
Who?
Participation is free for everybody. The competition is organised by
Tea Tušar, tea....@ijs.si
Vanessa Volz, van...@modl.ai
Boris Naujoks, boris....@th-koeln.de
Reply all
Reply to author
Forward
0 new messages