Increasing Generality in Machine Learning through Procedural Content Generation
Sebastian Risi, Julian Togelius

TL;DR
This paper reviews how Procedural Content Generation (PCG) can enhance the generality of machine learning algorithms by providing diverse, randomized environments that prevent overfitting and improve transferability.
Contribution
It offers a comprehensive review of PCG methods and discusses their potential to increase the generality of AI and machine learning models in gaming and beyond.
Findings
PCG introduces diversity that reduces overfitting in ML algorithms.
Randomized environments improve transferability of learned policies.
PCG tools can be integrated into AI research to enhance generalization.
Abstract
Procedural Content Generation (PCG) refers to the practice, in videogames and other games, of generating content such as levels, quests, or characters algorithmically. Motivated by the need to make games replayable, as well as to reduce authoring burden, limit storage space requirements, and enable particular aesthetics, a large number of PCG methods have been devised by game developers. Additionally, researchers have explored adapting methods from machine learning, optimization, and constraint solving to PCG problems. Games have been widely used in AI research since the inception of the field, and in recent years have been used to develop and benchmark new machine learning algorithms. Through this practice, it has become more apparent that these algorithms are susceptible to overfitting. Often, an algorithm will not learn a general policy, but instead a policy that will only work for a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
