Search arXiv⌕ Search

arXiv · 2610.19654

HACHIMI-II: From Role-Play to Learner Behavior Modeling for Faithful Student Simulation

Abstract

Simulated students let researchers test tutoring systems and teaching strategies before real learners are available, but only if the simulation reproduces where a particular learner succeeds and fails. The common approach asks a large language model to role-play a student, but a role does not model what this learner knows or will do next, so the model's own competence fills the gap. Simulated students perform at a level set by the model, differ little from one another, and seldom make the real learners' errors. We model the learner's behavior and recast student simulation as third-person prediction of the learner's next action. HACHIMI-II builds a student model from the learner's history, infers the learner's state for the current item or tutor turn, and compiles it into a behavior harness that constrains the next action. On three item-response datasets, the Wasserstein-1 distance between simulated and real student ability is 2.4--8.4$\times$ smaller than that of the strongest baseline. On two dialogue datasets, HACHIMI-II reproduces real student errors with the same knowledge type, locus, and mechanism 1.8--5.1$\times$ more often than the strongest baseline, and ablations trace the gains mainly to the explicit learner state. Predicting the learner makes capable models usable as simulated students.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yilin Jiang, Fei Tan, Xuanyu Yin, Jing Leng, Aimin Zhou. 2026-10-14. HACHIMI-II: From Role-Play to Learner Behavior Modeling for Faithful Student Simulation. https://arxiv.org/abs/2610.19654

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning From How Humans Correct

In industry NLP application, our manually labeled data has a certain number of noisy data. We present a simple method to find the noisy data and relabel them manually, meanwhile we collect the correction information. Then we present novel method to incorporate the human correction information into deep learning model. Human know how to correct noisy data. So the correction information can be inject into deep learning model. We do the experiment on our own text classification dataset, which is manually labeled, because we need to relabel the noisy data in our dataset for our industry application. The experiment result shows that our learn-on-correction method improve the classification accuracy from 91.7% to 92.5% in test dataset. The 91.7% accuracy is trained on the corrected dataset, which improve the baseline from 83.3% to 91.7% in test dataset. The accuracy under human evaluation achieves more than 97%.

cs.CL↗

LLMR: Knowledge Distillation with a Large Language Model-Induced Reward

Large language models have become increasingly popular and demonstrated remarkable performance in various natural language processing (NLP) tasks. However, these models are typically computationally expensive and difficult to be deployed in resource-constrained environments. In this paper, we propose LLMR, a novel knowledge distillation (KD) method based on a reward function induced from large language models. We conducted experiments on multiple datasets in the dialogue generation and summarization tasks. Empirical results demonstrate that our LLMR approach consistently outperforms traditional KD methods in different tasks and datasets.

cs.CL↗

C-VARC: A Large-Scale Chinese Value Rule Corpus for Value Alignment of Large Language Models

Aligning LLMs with Chinese values requires culturally grounded resources that connect abstract values to concrete behavioral guidance. We introduce C-VARC, a Chinese Value Rule Corpus containing 257,609 Rules of Thumb (RoTs) organized into three dimensions, 12 core values, and 50 derived values. Among them, 36,000 rules underwent independent human review by two annotators (Cohen's kappa>0.85), with disagreements adjudicated by a third. C-VARC supports reusable rule-driven pipelines for both value evaluation and model alignment. Compared with abstract-value guidance, RoT guidance produces greater semantic and character-level n-gram diversity. Across five non-political sensitive themes, the seven-model average selection rate for C-VARC-consistent options is at least 72.0%, while five Chinese annotators show overall rates of at least 87.5%. Conflicting RoT pairs further enable the construction of 404,505 moral dilemmas, with 7,191 of 10,998 evaluated cases eliciting cross-model disagreement. For alignment, C-VARC-Query consistently outperforms matched Value-only supervision on CMoralEval across both Qwen3-8B and Llama-3.1-8B-Instruct, with average gains of 2.97 and 12.82 percentage points, respectively, and positive paired gains across all three seeds for both backbones. It also improves CValues and C-Eval over Value-only supervision on both backbones. C-VARC thus provides a scalable Chinese normative resource for constructing both value-evaluation and alignment supervision.

cs.CL↗