English

AutoPRM: Automating Procedural Supervision for Multi-Step Reasoning via Controllable Question Decomposition

Computation and Language 2024-02-20 v1

Abstract

Recent advancements in large language models (LLMs) have shown promise in multi-step reasoning tasks, yet their reliance on extensive manual labeling to provide procedural feedback remains a significant impediment. To address this challenge, in this paper, we propose a novel self-supervised framework AutoPRM that efficiently enhances the fine-tuning of LLMs for intricate reasoning challenges. Specifically, AutoPRM first decomposes complex problems into more manageable subquestions with a controllable granularity switch, then sequentially apply reinforcement learning to iteratively improve the subquestion solver. Additionally, we propose context-guided-decoding to avoid reward tampering and guide the subquestion solver towards the solution of the holistic problem. Extensive experiments show that AutoPRM significantly improves performance on mathematical and commonsense reasoning tasks over SOTA. More encouragingly, AutoPRM can be easily integrated with other orthogonal reasoning pipelines.

Keywords

Cite

@article{arxiv.2402.11452,
  title  = {AutoPRM: Automating Procedural Supervision for Multi-Step Reasoning via Controllable Question Decomposition},
  author = {Zhaorun Chen and Zhuokai Zhao and Zhihong Zhu and Ruiqi Zhang and Xiang Li and Bhiksha Raj and Huaxiu Yao},
  journal= {arXiv preprint arXiv:2402.11452},
  year   = {2024}
}

Comments

17 pages, 4 figures, 11 tables

R2 v1 2026-06-28T14:52:05.770Z