1 code implementation • 7 Jun 2024 • Miguel González-Duque, Richard Michael, Simon Bartels, Yevgen Zainchkovskyy, Søren Hauberg, Wouter Boomsma
Optimizing discrete black-box functions is key in several domains, e. g. protein engineering and drug design.
1 code implementation • 26 Apr 2024 • Richard Michael, Simon Bartels, Miguel González-Duque, Yevgen Zainchkovskyy, Jes Frellsen, Søren Hauberg, Wouter Boomsma
To optimize efficiently over discrete data and with only few available target observations is a challenge in Bayesian optimization.
1 code implementation • NeurIPS 2023 • Shyam Sudhakaran, Miguel González-Duque, Claire Glanois, Matthias Freiberger, Elias Najarro, Sebastian Risi
MarioGPT can not only generate diverse levels, but can be text-prompted for controllable level generation, addressing one of the key challenges of current PCG techniques.
no code implementations • 4 Oct 2022 • Noémie Jaquier, Leonel Rozo, Miguel González-Duque, Viacheslav Borovitskiy, Tamim Asfour
This may be attributed to the lack of computational models that fill the gap between the discrete hierarchical structure of the taxonomy and the high-dimensional heterogeneous data associated to its categories.
no code implementations • 31 May 2022 • Miguel González-Duque, Rasmus Berg Palm, Søren Hauberg, Sebastian Risi
Deep generative models can automatically create content of diverse types.
1 code implementation • ICLR 2022 • Rasmus Berg Palm, Miguel González-Duque, Shyam Sudhakaran, Sebastian Risi
Additionally, we show that the VNCA can learn a distribution of stable attractors that can recover from significant damage.
1 code implementation • 9 Jun 2021 • Georgios Arvanitidis, Miguel González-Duque, Alison Pouplin, Dimitris Kalatzis, Søren Hauberg
Latent space geometry has shown itself to provide a rich and rigorous framework for interacting with the latent variables of deep generative models.
no code implementations • 18 May 2021 • Miguel González-Duque, Rasmus Berg Palm, Sebastian Risi
Current systems for DDA rely on expensive data mining, or on hand-crafted rules designed for particular domains, and usually adapts to keep players in the flow, leaving no room for the designer to present content that is purposefully easy or difficult.
1 code implementation • 15 May 2020 • Miguel González-Duque, Rasmus Berg Palm, David Ha, Sebastian Risi
The approach can reliably find levels with a specific target difficulty for a variety of planning agents in only a few trials, while maintaining an understanding of their skill landscape.