Codified Finite-state Machines for Role-playing

ICLR 2026 Conference Submission579 Authors

Keywords: Role-playing, State Modeling, Grounding System

Abstract:

Modeling latent character states is crucial for consistent and engaging role-playing (RP) with large language models (LLMs).
Yet, existing prompting-based approaches mainly capture surface actions, often failing to track the latent states that drive interaction.
We revisit finite-state machines (FSMs), long used in game design to model state transitions.
While effective in small, well-specified state spaces, traditional hand-crafted, rule-based FSMs struggle to adapt to the open-ended semantic space of RP.
To address this, we introduce Codified Finite-State Machines (CFSMs), a framework that automatically codifies textual character profiles into FSMs using LLM-based coding.
CFSMs extract key states and transitions directly from the profile, producing interpretable structures that enforce character consistency.
To further capture uncertainty and variability, we extend CFSMs into Codified Probabilistic Finite-State Machines (CPFSMs), where transitions are modeled as probability distributions over states.
Through both synthetic evaluations and real-world RP scenarios in established artifacts, we demonstrate that CFSM and CPFSM outperform generally applied baselines, verifying effectiveness not only in structured tasks but also in open-ended stochastic state exploration.

Primary Area: applications to computer vision, audio, language, and other modalities

Submission Number: 579