MétaCan
Menu
Back to cohort
Record W4397026545 · doi:10.1109/tg.2024.3402626

AstroBug: Automatic Game Bug Detection Using Deep Learning

2024· article· en· W4397026545 on OpenAlex
Loutfouz Zaman

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Games · 2024
Typearticle
Languageen
FieldSocial Sciences
TopicDigital Games and Media
Canadian institutionsOntario Tech University
Fundersnot available
KeywordsComputer scienceDeep learningArtificial intelligenceGame based learningNatural language processingMultimedia

Abstract

fetched live from OpenAlex

Traditional methods of video game bug detection, such as manual testing, have been effective, but they can also be time-consuming and costly. While Automated Bug Detection (ABD) techniques hold great promise for improving testing, they still face several challenges that need to be addressed to be effective in practice. In this work, we introduce a new framework to detect perceptual bugs using a Long Short-Term Memory (LSTM) network, which detects bugs in games as anomalies. The detected buggy frames are then clustered to determine the category of the occurred bug. The framework was evaluated on two First Person Shooter (FPS) games. We further enhanced the framework by implementing a Reinforcement Learning (RL) agent to autonomously gather datasets, effectively addressing the need for human players to collect data and manually browse through games. The enhancement was performed on a Role-Playing Game (RPG). The outcomes obtained validate the effectiveness of the framework.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.982
Threshold uncertainty score0.492

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.021
GPT teacher head0.293
Teacher spread0.272 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it