An Empirical Study of RLVR Fine-Tuning for Mathematical Problem Solving in LLMs

Abstract

Large language models have shown immense improvement in coding and math performances thanks to reinforcement learning boosted algorithms. However, its true impact on broadening the reasoning and analytical capacities of an LLM is still contended. In this dissertation, we outline the foundations of Large Language Models, and delve into Reinforcement Learning with Verifiable Rewards (RLVR). We discuss various strategies to efficiently manipulate memory during a fine tuning update. We finally perform RLVR fine-tuning techniques on different models with varied use cases and compare their performances, which corroborate the efficiency of RLVR.