CodePMP: Scalable Preference Model Pretraining for Large Language Model Reasoning
<|reference_start|>CodePMP: Scalable Preference Model Pretraining for Large Language Model Reasoning: Large language models (LLMs) have made significant progress in natural language understanding and generation, driven by scalable pretraining and advanced finetuning. However, enhancing reasoning abilities in LLMs, particularly via reinforcement learning from human feedback (RLHF), remains challenging due to the scarcity of high-quality preference data, which is labor-intensive to annotate and crucial for reward model (RM) finetuning. To alleviate this issue, we introduce CodePMP, a scalable preference model pretraining (PMP) pipeline that utilizes a large corpus of synthesized code-preference pairs from publicly available high-quality source code. CodePMP improves RM finetuning efficiency by pretraining preference models on large-scale synthesized code-preference pairs. We evaluate CodePMP on mathematical reasoning tasks (GSM8K, MATH) and logical reasoning tasks (ReClor, LogiQA2.0), consistently showing significant improvements in reasoning performance of LLMs and highlighting the importance of scalable preference model pretraining for efficient reward modeling.<|reference_end|>
@article{yu2024codepmp:,
    title={CodePMP: Scalable Preference Model Pretraining for Large Language Model
  Reasoning},
    author={Huimu Yu, Xing Wu, Weidong Yin, Debing Zhang, Songlin Hu},
    journal={arXiv preprint arXiv:2410.02229},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.02229},
    primaryClass={cs.AI cs.CL}
}