Papers › CS4: Measuring the Creativity of Large Language Models Automatically by Controlling...

CS4: Measuring the Creativity of Large Language Models Automatically by Controlling the Number of Story-Writing Constraints

5 Oct 2024arXiv:2410.04197archive 2025-07-28

Anirudh Atmakuru, Jatin Nainani, Rohith Siddhartha Reddy Bheemreddy, Anirudh Lakkaraju, Zonghai Yao, Hamed Zamani, Haw-Shiuan Chang

Evaluating the creativity of large language models (LLMs) in story writing is difficult because LLM-generated stories could seemingly look creative but be very similar to some existing stories in their huge and proprietary training corpus. To overcome this challenge, we introduce a novel benchmark dataset with varying levels of prompt specificity: CS4 (𝐂omparing the 𝐒kill of 𝐂reating 𝐒tories by 𝐂ontrolling the 𝐒ynthesized 𝐂onstraint 𝐒pecificity). By increasing the number of requirements/constraints in the prompt, we can increase the prompt specificity and hinder LLMs from retelling high-quality narratives in their training data. Consequently, CS4 empowers us to indirectly measure the LLMs' creativity without human annotations. Our experiments on LLaMA, Gemma, and Mistral not only highlight the creativity challenges LLMs face when dealing with highly specific prompts but also reveal that different LLMs perform very differently under different numbers of constraints and achieve different balances between the model's instruction-following ability and narrative coherence. Additionally, our experiments on OLMo suggest that Learning from Human Feedback (LHF) can help LLMs select better stories from their training data but has limited influence in boosting LLMs' ability to produce creative stories that are unseen in the training corpora. The benchmark is released at https://github.com/anirudhlakkaraju/cs4_benchmark.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2410.04197")

Code

Syntology Ran 7 of 11 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 7 ran with no contract checked.

By repository: official repository: 11 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

anirudhlakkaraju/cs4_benchmark officialmentioned in paperMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 7 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7ran
4unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from anirudhlakkaraju/cs4_benchmark. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Quc_9VsRcs_7_39 anirudhlakkaraju/cs4_benchmark/evaluation/coherence_vs_constraint_graph.py official repository ran MIT (permissive) · fbca3fb05f5d729f · report
calculate_quc_and_rcs anirudhlakkaraju/cs4_benchmark/evaluation/coherence_vs_constraint_graph.py official repository ran MIT (permissive) · 41dfba5ffb866e95 · report
calculate_quc_and_rcs anirudhlakkaraju/cs4_benchmark/evaluation/quc_and_rcs.py official repository ran MIT (permissive) · b8d6b945452eee55 · report
chat anirudhlakkaraju/cs4_benchmark/evaluation/story_quality_eval.py official repository ran MIT (permissive) · 9b2db3fdfca284ab · report
generate_response anirudhlakkaraju/cs4_benchmark/code_files/storygen.py official repository ran MIT (permissive) · b547c94262782cf4 · report
initialize_openai anirudhlakkaraju/cs4_benchmark/evaluation/story_quality_eval.py official repository ran MIT (permissive) · f3c3e6083ca33d17 · report
load_grouped_dfs_from_json anirudhlakkaraju/cs4_benchmark/evaluation/quc_and_rcs.py official repository ran MIT (permissive) · 4874c30058799290 · report
main anirudhlakkaraju/cs4_benchmark/evaluation/constraint_satisfaction.py official repository unverified MIT (permissive) · 1a773a549f580915 · report
main anirudhlakkaraju/cs4_benchmark/evaluation/diversity_calculation.py official repository unverified MIT (permissive) · 5baffd5407078613 · report
main anirudhlakkaraju/cs4_benchmark/evaluation/diversity_graphs.py official repository unverified MIT (permissive) · c811600eab5c3bf7 · report
parse_evaluation anirudhlakkaraju/cs4_benchmark/evaluation/story_quality_eval.py official repository unverified MIT (permissive) · f6bdebfeb1ddf260 · report

Tasks

Instruction FollowingSpecificity

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

LLaMA

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections