← Back to all news
arXiv Computation and Language By Fagun Patel, Sang T. Truong, Duc Q. Nguyen, Kazunori Fukuhara, Benjamin W. Domingue, Sanmi Koyejo, Nick Haber

A Dataset for Modeling Iterative Problem-Solving

Read the original on arXiv Computation and Language →

The paper introduces CodeInsight, a large-scale dataset of over 3 million code submissions from 3,286 undergraduate students in two introductory C++ courses, capturing test‑case outcomes, timestamps, and source code. It presents a benchmark that evaluates various modeling approaches—including a Recurrent State Space Model and an LLM‑based predictor—on their ability to predict iterative problem‑solving dynamics such as performance changes and error persistence. The study finds that the RSSM outperforms other models on most courses, while the LLM generates full submissions but with lower predictive accuracy, suggesting it functions more as a generative solver than a behavior predictor.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

Related stories

arXiv AI
Oct 12

SWE-Critix: Post-Training Generalist Verifiers for Assessing Coding-Agent Trajectories

SWE-Critix is a post‑training pipeline that creates generalist verifiers for coding‑agent trajectories. It uses supervised fine‑tuning followed by reinforcement learning to train 30B models on CodeForge‑Preview data, enabling the verifier to predict completion labels and generate natural‑language explanations. The approach raises classification accuracy from 57% to 78% on a held‑out test set.

By Jiajun Hu, Chun Yong Chong
llmsagentsreinforcement-learningfine-tuning
More like this →
arXiv Computation and Language
Aug 31

SMRC: Aligning Large Language Models with Student Reasoning for Mathematical Error Correction

SMRC is a new method that aligns large language models with student reasoning for mathematical error correction. It treats student reasoning as a multi‑step decision problem and uses Monte Carlo Tree Search to find optimal correction paths, while a breadth‑first search guided by the model generates reward signals that are back‑propagated to supervise intermediate steps. The authors also introduce the MSEB benchmark of 158 high‑school math problems and a dual evaluation protocol focusing on solution accuracy and correct‑step retention, showing that SMRC outperforms existing methods on several datasets.

By Biaojie Zeng, Min Zhang, Juan Zhou, Fengrui Liu, Ruiyang Huang, Yu Song, Xin Lin
llmsbenchmarks
More like this →
arXiv Machine Learning
Sep 22

Success Leaves Detours: Learning Executable Walkthroughs for Long-Horizon Agents

The paper introduces Trace, a framework that transforms sparse-reward trajectories into executable walkthroughs by identifying progress anchors, propagating credit, and estimating action prerequisites. Trace compiles noisy trajectories into state‑conditioned, verifiable procedures that remove loops and detours, enabling reuse, intermediate‑state resumption, and programmatic verification. Experiments on J‑TTL, WebShop, and ScienceWorld with three open‑source LLMs show that Trace outperforms eight baselines, improving average AUC and Final‑$3$ by 30.0% and 40.5% while using fewer inference tokens.

By Kaijie Chen, Chenyu Fang, Liang Yan, Bo Li, Bo Zhang, Peng Ye
llmsagents
More like this →
arXiv AI
Jun 9

AlphaOPT: Formulating Optimization Programs with Self-Improving LLM Experience Library

arXiv:2510. 18428v4 Announce Type: replace Abstract: Optimization modeling underlies critical decision-making across industries, yet remains difficult to automate: natural-language problem descriptions must be translated into precise mathematical formulations and executable solver code.

By Minwei Kong, Ao Qu, Xiaotong Guo, Wenbin Ouyang, Chonghe Jiang, Han Zheng, Yining Ma, Dingyi Zhuang, Yuhan Tang, Junyi Li, Shenhao Wang, Haris Koutsopoulos, Hai Wang, Cathy Wu, Jinhua Zhao
llmsbenchmarks
More like this →