Learning to win: A process reward model for competitive machine learning agents
| bracu.degree.level | Postgraduate | |
| bracu.type.group | Student Works | |
| datacite.rights | Open Access | |
| dc.contributor.advisor | Alam, Md. Golam Rabiul | |
| dc.contributor.author | Ahmed, Sajjad | |
| dc.contributor.department | Department of Computer Science and Engineering | |
| dc.date.accessioned | 2026-07-26T06:09:38Z | |
| dc.date.available | 2026-07-26T06:09:38Z | |
| dc.date.copyright | 2026 | |
| dc.date.issued | 2026-03 | |
| dc.description | This thesis is submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science and Engineering, 2026. | |
| dc.description | Cataloged from PDF version of thesis. | |
| dc.description | Includes bibliographical references (pages 44-46). | |
| dc.description.abstract | Large Language Model (LLM)-based coding agents are increasingly deployed for multi-step data science tasks, yet no systematic study has examined how these agents behave across diverse competitive problems. This thesis presents a two-part investigation using 194 human-supervised agent human feedback JSONs across 103 Kaggle competitions (1,584 turns total). First, we conduct a comprehensive empirical study. We also propose and show that process-oriented quality metrics. Second, we develop a Process Reward Model (PRM) for data science workflows—the first application of PRMs beyond mathematical reasoning—that predicts whether an intermediate step will improve competition scores. Using 49 tabular features across 6 feature groups, we train XGBoost and LightGBM baselines and conduct a full feature ablation study. Code features (code length, imports, deltas) emerge as the strongest individual tabular predictors. We further fine-tune Qwen2.5-Coder-3B with QLoRA as a hybrid language-model-based PRM (v2), incorporating code snippets and tabular features into semantic prompts, which achieves AUROC 0.656—surpassing the best tabular baseline (0.530) by 12.6 points—by leveraging semantic content from agent plans, reflections, and code. To establish the necessity of domain-specific finetuning, we evaluate zero-shot frontier models (i.e., GPT-5, Gemini 3.0 Flash/Pro, Llama 3.3 70B) on the same task. GPT-4o achieves the highest zero-shot AUROC (0.709), outperforming our fine-tuned 3B model, while most other frontier models fall to majority class prediction (AUROC 0.500). This demonstrates that while powerful zero-shot models can reason about the task, domain-specific fine-tuning remains valuable for smaller models, achieving competitive performance with 200x fewer parameters. Ultimately, our research demonstrates that observable code signals are significantly more reliable than an agent’s articulated plans for predicting success, providing a robust foundation for the development of real-time guidance systems in competitive data science. | |
| dc.description.degree | Master of Science in Computer Science and Engineering | |
| dc.description.statementofresponsibility | Sajjad Ahmed | |
| dc.format.extent | 57 pages | |
| dc.identifier.other | ID 20366018 | |
| dc.identifier.uri | https://hdl.handle.net/10361/28632 | |
| dc.language.iso | en_US | |
| dc.publisher | BRAC University | |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | |
| dc.rights | BRAC University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | |
| dc.subject | LLM | |
| dc.subject | Large language models | |
| dc.subject | Data science | |
| dc.subject | Process reward model | |
| dc.subject | Reinforcement learning from human feedback | |
| dc.subject | RLHF | |
| dc.subject.lcsh | Machine learning. | |
| dc.subject.lcsh | Reinforcement learning. | |
| dc.subject.lcsh | Natural language processing (Computer science). | |
| dc.title | Learning to win: A process reward model for competitive machine learning agents | |
| dc.type | Thesis |