paper-with-me

Papers

COS(M+O)S: Curiosity and RL-Enhanced MCTS for Exploring Story Space via Language Models

2025-01-28 · Tobias Materzok

We present COS(M+O)S, a System 2-inspired framework for open-ended plot development that systematically explores the vast space of possible story expansions, enabling a 3B-parameter language model to approach the plot quality of a 70B model on select short-story tasks. The method accomplishes this by combining Monte Carlo Tree Search (MCTS), guided by a step-level value model that rewards moderate surprisal (curiosity) while penalizing incoherence, and Odds Ratio Preference Optimization (ORPO) to fine-tune the policy on high-value plot expansions. This iterative reinforcement learning loop systematically explores multiple candidate plot branches, backpropagates quality signals, and adapts the policy for faster convergence, notably shifting the policy from puzzle-based Chain-of-Thought to more character-driven storytelling. In small-scale tests with short-story prompts, 67%-77% of participants favored COS(M+O)S's highest-rated expansions over lower-rated ones, suggesting that our learned value function aligns. GPT-4o ratings further show that COS(M+O)S surpasses naive single-pass decoding from Llama 3.2 3B by 0.59 SD, coming within 0.06 SD of Llama 3.1 70B (no significant difference, p=0.93). Pairwise comparisons with o1 place COS(M+O)S 1.5 SD above the 3B baseline and find no statistically significant gap from 70B. Nevertheless, absolute story quality remains modest, constrained by the small model's capacity and limited training data.

📄 PDF Abstract BibTeX arXiv:2501.17104

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

LLaMA LLaMA is a collection of foundation language models ranging from 7B to 65B parameters. It is based on the transformer architecture with various improvements that were…

Similar Papers 제목 키워드 기반

Customized Monte Carlo Tree Search for LLVM/Polly's Composable Loop Optimization Transformations

2021-05-10 · Jaehoon Koo, Prasanna Balaprakash, Michael Kruse, Xingfu Wu 외

Polly is the LLVM project's polyhedral loop nest optimizer. Recently, user-directed loop transformation pragmas were proposed based on LLVM/Clang and Polly. The search space exposed by the transformation pragmas is a tre…

Food Recommendation With Balancing Comfort and Curiosity

2025-03-24 · Yuto Sakai, Qiang Ma

Food is a key pleasure of traveling, but travelers face a trade-off between exploring curious new local food and choosing comfortable, familiar options. This creates demand for personalized recommendation systems that ba…

Density EstimationFood recommendationRecommendation Systems

Narrative Studio: Visual narrative exploration using LLMs and Monte Carlo Tree Search

2025-04-03 · Parsa Ghaffari, Chris Hokamp

Interactive storytelling benefits from planning and exploring multiple 'what if' scenarios. Modern LLMs are useful tools for ideation and exploration, but current chat-based user interfaces restrict users to a single lin…

What killed the cat? Towards a logical formalization of curiosity (and suspense, and surprise) in narratives

2024-10-11 · Florence Dupin de Saint-Cyr, Anne-Gwenn Bosser, Benjamin Callac, Eric Maisel

We provide a unified framework in which the three emotions at the heart of narrative tension (curiosity, suspense and surprise) are formalized. This framework is built on nonmonotonic reasoning which allows us to compact…

RethinkMCTS: Refining Erroneous Thoughts in Monte Carlo Tree Search for Code Generation

2024-09-15 · Qingyao Li, Wei Xia, Kounianhua Du, Xinyi Dai 외

LLM agents enhanced by tree search algorithms have yielded notable performances in code generation. However, current search algorithms in this domain suffer from low search quality due to several reasons: 1) Ineffective …

Code GenerationHumanEval