A Dataset for Modeling Iterative Problem-Solving

Fagun Patel, Sang T. Truong, Duc Quang Nguyen, Kazunori Fukuhara, Nick Haber, Ben Domingue, Sanmi Koyejo


Abstract
Solving problems through repeated attempts is a sequential modeling task: at each step, the solver receives feedback and decides how to revise their solutions. Predicting whether performance improves, plateaus, or regresses across attempts is central to understanding any iterative problem-solving process in both human learners and autonomous agents. Beyond outcomes, modeling what errors persist and how strategies shift across attempts provides deeper insight into the mechanics of sequential learning. Studying these dynamics requires observing many solvers as they attempt, receive feedback, and revise. Programming courses with automated grading provide this setting, as students iteratively submit code to test suites and receive feedback on every attempt. We therefore curate CodeInsight, a large-scale dataset of over 3 million submissions from 3,286 undergraduates across 2 introductory C++ courses in 2 academic years, with test-case-level outcomes, timestamps, and source code. On this dataset, we build a benchmark that evaluates models spanning parametric, sequential, and generative traditions under a shared calibration-and-scoring protocol, including a Recurrent State Space Model (RSSM) adapted to track solver characteristics through discrete latent variables and an LLM-based predictor that generates explicit solutions. The adapted RSSM achieves the strongest predictive accuracy on three of the four courses. The LLM predictor is less accurate but produces full submissions at each attempt, enabling direct analysis of failure modes. We find that the model’s coding proficiency is inversely related to predictive performance in this setting, with the LLM better understood as a generative solver conditioned on context rather than a faithful predictor of solver behavior. We publicly release our code and the dataset on request to facilitate future research.
Anthology ID:
2026.findings-emnlp.2179
Volume:
Findings of the Association for Computational Linguistics: EMNLP 2026
Month:
October
Year:
2026
Address:
Budapest, Hungary
Editors:
Hung-Yi Lee, Sunipa Dev, Jessy Li, Desmond Elliott
Venue:
Findings
SIG:
SIGDAT
Publisher:
Association for Computational Linguistics
Note:
Pages:
46590–46620
Language:
URL:
https://aclanthology.org/2026.findings-emnlp.2179/
DOI:
Bibkey:
Cite (ACL):
Fagun Patel, Sang T. Truong, Duc Quang Nguyen, Kazunori Fukuhara, Nick Haber, Ben Domingue, and Sanmi Koyejo. 2026. A Dataset for Modeling Iterative Problem-Solving. In Findings of the Association for Computational Linguistics: EMNLP 2026, pages 46590–46620, Budapest, Hungary. Association for Computational Linguistics.
Cite (Informal):
A Dataset for Modeling Iterative Problem-Solving (Patel et al., Findings 2026)
Copy Citation:
PDF:
https://aclanthology.org/2026.findings-emnlp.2179.pdf