{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/the-n-tuple-bandit-evolutionary-algorithm-for","title":"The N-Tuple Bandit Evolutionary Algorithm for Game Agent Optimisation","arxiv_id":"1802.05991","date":"2018-02-16","proceeding":null,"authors":["Simon M. Lucas","Jialin Liu","Diego Perez-Liebana"],"abstract":"This paper describes the N-Tuple Bandit Evolutionary Algorithm (NTBEA), an\noptimisation algorithm developed for noisy and expensive discrete\n(combinatorial) optimisation problems. The algorithm is applied to two\ngame-based hyper-parameter optimisation problems. The N-Tuple system directly\nmodels the statistics, approximating the fitness and number of evaluations of\neach modelled combination of parameters. The model is simple, efficient and\ninformative. Results show that the NTBEA significantly outperforms grid search\nand an estimation of distribution algorithm.","url_abs":"http://arxiv.org/abs/1802.05991v2","url_pdf":"http://arxiv.org/pdf/1802.05991v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"the-n-tuple-bandit-evolutionary-algorithm-for","repo_url":"https://github.com/Bam4d/NTBEA","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-n-tuple-bandit-evolutionary-algorithm-for","repo_url":"https://github.com/SimonLucas/KotlinGamesJS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-n-tuple-bandit-evolutionary-algorithm-for","repo_url":"https://github.com/SimonLucas/ntbea","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"the-n-tuple-bandit-evolutionary-algorithm-for","repo_url":"https://github.com/two2tee/WorldModelPlanning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}