Improving Conditional Level Generation using Automated Validation in Match-3 Games

• URL: http://arxiv.org/abs/2409.06349v2
• Date: Wed, 18 Sep 2024 07:44:13 GMT
• Title: Improving Conditional Level Generation using Automated Validation in Match-3 Games
• Authors: Monica Villanueva Aylagas, Joakim Bergdahl, Jonas Gillberg, Alessandro Sestini, Theodor Tolstoy, Linus Gisslén,
• Abstract summary: This paper proposes Avalon, a novel method to improve models that learn from existing level designs. We use a conditional variational autoencoder to generate layouts for match-3 levels. We quantitatively evaluate our approach by comparing it to an ablated model without difficulty conditioning.
• Score: 39.887603099741696
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generative models for level generation have shown great potential in game production. However, they often provide limited control over the generation, and the validity of the generated levels is unreliable. Despite this fact, only a few approaches that learn from existing data provide the users with ways of controlling the generation, simultaneously addressing the generation of unsolvable levels. %One of the main challenges it faces is that levels generated through automation may not be solvable thus requiring validation. are not always engaging, challenging, or even solvable. This paper proposes Avalon, a novel method to improve models that learn from existing level designs using difficulty statistics extracted from gameplay. In particular, we use a conditional variational autoencoder to generate layouts for match-3 levels, conditioning the model on pre-collected statistics such as game mechanics like difficulty and relevant visual features like size and symmetry. Our method is general enough that multiple approaches could potentially be used to generate these statistics. We quantitatively evaluate our approach by comparing it to an ablated model without difficulty conditioning. Additionally, we analyze both quantitatively and qualitatively whether the style of the dataset is preserved in the generated levels. Our approach generates more valid levels than the same method without difficulty conditioning.

Related papers

• Fluid: Scaling Autoregressive Text-to-image Generative Models with Continuous Tokens [53.99177152562075]
  Scaling up autoregressive models in vision has not proven as beneficial as in large language models. We focus on two critical factors: whether models use discrete or continuous tokens, and whether tokens are generated in a random or fixed order using BERT- or GPT-like transformer architectures. Our results show that while all models scale effectively in terms of validation loss, their evaluation performance -- measured by FID, GenEval score, and visual quality -- follows different trends.
  arXiv  Detail & Related papers  (2024-10-17T17:59:59Z)
• Promises and Pitfalls of Generative Masked Language Modeling: Theoretical Framework and Practical Guidelines [74.42485647685272]
  We focus on Generative Masked Language Models (GMLMs) We train a model to fit conditional probabilities of the data distribution via masking, which are subsequently used as inputs to a Markov Chain to draw samples from the model. We adapt the T5 model for iteratively-refined parallel decoding, achieving 2-3x speedup in machine translation with minimal sacrifice in quality.
  arXiv  Detail & Related papers  (2024-07-22T18:00:00Z)
• Segue: Side-information Guided Generative Unlearnable Examples for Facial Privacy Protection in Real World [64.4289385463226]
  We propose Segue: Side-information guided generative unlearnable examples. To improve transferability, we introduce side information such as true labels and pseudo labels. It can resist JPEG compression, adversarial training, and some standard data augmentations.
  arXiv  Detail & Related papers  (2023-10-24T06:22:37Z)
• Ordinal Regression for Difficulty Estimation of StepMania Levels [18.944506234623862]
  We formalize and analyze the difficulty prediction task on StepMania levels as an ordinal regression (OR) task. We evaluate many competitive OR and non-OR models, demonstrating that neural network-based models significantly outperform the state of the art. We conclude with a user experiment showing our trained models' superiority over human labeling.
  arXiv  Detail & Related papers  (2023-01-23T15:30:01Z)
• Generative Modeling Helps Weak Supervision (and Vice Versa) [87.62271390571837]
  We propose a model fusing weak supervision and generative adversarial networks. It captures discrete variables in the data alongside the weak supervision derived label estimate. It is the first approach to enable data augmentation through weakly supervised synthetic images and pseudolabels.
  arXiv  Detail & Related papers  (2022-03-22T20:24:21Z)
• Level Generation for Angry Birds with Sequential VAE and Latent Variable Evolution [25.262831218008202]
  We develop a deep-generative-model-based level generation for the game domain of Angry Birds. Experiments show that the proposed level generator drastically improves the stability and diversity of generated levels.
  arXiv  Detail & Related papers  (2021-04-13T11:23:39Z)
• Text Generation by Learning from Demonstrations [17.549815256968877]
  Current approaches to text generation largely rely on autoregressive models and maximum likelihood estimation. We propose GOLD: an easy-to-optimize algorithm that learns from expert demonstrations by importance weighting. According to both automatic and human evaluation, models trained by GOLD outperform those trained by MLE and policy gradient.
  arXiv  Detail & Related papers  (2020-09-16T17:58:37Z)
• Fast and Three-rious: Speeding Up Weak Supervision with Triplet Methods [24.190587751595455]
  Weak supervision is a popular method for building machine learning models without relying on ground truth annotations. Existing approaches use latent variable estimation to model the noisy sources. We show that for a class of latent variable models highly applicable to weak supervision, we can find a closed-form solution to model parameters. We use this insight to build FlyingSquid, a weak supervision framework that runs orders of magnitude faster than previous weak supervision approaches.
  arXiv  Detail & Related papers  (2020-02-27T07:51:50Z)
• AvgOut: A Simple Output-Probability Measure to Eliminate Dull Responses [97.50616524350123]
  We build dialogue models that are dynamically aware of what utterances or tokens are dull without any feature-engineering. The first model, MinAvgOut, directly maximizes the diversity score through the output distributions of each batch. The second model, Label Fine-Tuning (LFT), prepends to the source sequence a label continuously scaled by the diversity score to control the diversity level. The third model, RL, adopts Reinforcement Learning and treats the diversity score as a reward signal.
  arXiv  Detail & Related papers  (2020-01-15T18:32:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.