Training Verifiers to Solve Math Word Problems
원문 초록
State-of-the-art language models can match human performance on many tasks, but they still struggle to robustly perform multi-step mathematical reasoning. To diagnose the failures of current models and support research, we introduce GSM8K, a dataset of 8.5K high quality linguistically diverse grade school math word problems. We find that even the largest transformer models fail to achieve high test performance, despite the conceptual simplicity of this problem distribution. To increase performance, we propose training verifiers to judge the correctness of model completions. At test time, we generate many candidate solutions and select the one ranked highest by the verifier. We demonstrate that verification significantly improves performance on GSM8K, and we provide strong empirical evidence that verification scales more effectively with increased data than a finetuning baseline.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Discriminative Policy Optimization for Token-Level Reward Models
EquivPruner: Boosting Efficiency and Quality in LLM-Based Search via Action Pruning
CoRE: Enhancing Metacognition with Label-free Self-evaluation in LRMs
Xolver: Multi-Agent Reasoning with Holistic Experience Learning Just Like an Olympiad Team
Learning to Rank Chain-of-Thought: An Energy-Based Approach with Outcome Supervision
Reasoning or Memorization? Unreliable Results of Reinforcement Learning Due to Data Contamination
토론
이 논문과 연결된 포럼 글이 아직 없습니다.