LGCLOct 27, 2021

Training Verifiers to Solve Math Word Problems

arXiv:2110.14168v29106 citations
Originality Incremental advance
AI Analysis

This addresses the challenge of robust mathematical reasoning in language models, which is incremental as it builds on existing verification methods for a specific domain.

The authors tackled the problem of language models struggling with multi-step mathematical reasoning by introducing GSM8K, a dataset of 8.5K grade school math word problems, and found that training verifiers to judge model completions significantly improved performance on this dataset.

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.

Code Implementations6 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes