Ordinal Regression for Difficulty Estimation of StepMania Levels

Billy Joe Franks, Benjamin Dinkelmann, Sophie Fellenz, Marius Kloft
1/23/2023
cs.LG

No confident code implementation found for this paper.

Abstract

StepMania is a popular open-source clone of a rhythm-based video game. As is common in popular games, there is a large number of community-designed levels. It is often difficult for players and level authors to determine the difficulty level of such community contributions. In this work, we formalize and analyze the difficulty prediction task on StepMania levels as an ordinal regression (OR) task. We standardize a more extensive and diverse selection of this data resulting in five data sets, two of which are extensions of previous work. We evaluate many competitive OR and non-OR models, demonstrating that neural network-based models significantly outperform the state of the art and that StepMania-level data makes for an excellent test bed for deep OR models. We conclude with a user experiment showing our trained models' superiority over human labeling.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{franks2023ordinal,
  title  = {Ordinal Regression for Difficulty Estimation of StepMania Levels},
  author = {Billy Joe Franks and Benjamin Dinkelmann and Sophie Fellenz and Marius Kloft},
  year   = {2023},
  eprint = {2301.09485},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2301.09485v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2301.09485.svg)](https://codeofpaper.com/paper/2301.09485)

Discussion