MétaCan
Menu
Back to cohort

An Analysis of Scoring Methods for Reranking in Large Language Model Story Generation

2025· article· en· W4411120498 on OpenAlex

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

Venuenot available
Typearticle
Languageen
FieldSocial Sciences
TopicComputational and Text Analysis Methods
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceNatural language processingLanguage modelArtificial intelligence

Abstract

fetched live from OpenAlex

Outline-conditioned story generation using Large Language Models (LLMs) offers a promising approach for automating narrative creation.Some outline-conditioned story generation methods use automatic scoring during the generation process in order to improve the story quality.However, current research has shown that automatic scoring is not ideal for assessing story quality.This paper evaluates three proposed automatic story-scoring methods to improve the reranking of outputs during the generation process.These scoring methods leverage different prompting strategies and finetuning techniques to enhance the accuracy and relevance of the assessments.By experimenting with these approaches within a beam search framework, we aim to identify the most effective methods for optimizing story-generation outcomes.While we have found no significant overall difference between these methods in terms of their agreement with human ratings during story generation, the overall story ratings by human evaluators are average.These findings motivate the need for improved automatic scoring techniques and datasets while also indicating that simpler, more easily implementable scoring methods for reranking perform comparably to more complex approaches.

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.005
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.595
Threshold uncertainty score0.920

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
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.073
GPT teacher head0.518
Teacher spread0.445 · 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

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicComputational and Text Analysis MethodsFrench-language works237,207