Elamur Research
☰
home / papers / 2024 / Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMs

Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMs

Written for the Research library (claude-opus-5-5) from the paper text, in our own words: the license "CC BY-NC-SA 4.0 (arXiv)" does not allow redistributing the text itself. Original — arxiv.org/pdf/2406.18629

Summary

Large language models often fail at multi-step math because one slip anywhere in a long derivation ruins the final answer. Standard Direct Preference Optimization (DPO) helps little here. It compares whole answers, so a rejected solution that is correct except for one faulty step gives a noisy training signal. Models trained this way barely improve at telling good outputs from bad ones. Step-DPO changes the unit of preference from the full answer to a single reasoning step. Given a problem and a prefix of correct steps, the model learns to prefer a correct next step over the first wrong one. The authors also built a low-cost three-stage pipeline (error collection, step localization, rectification). It produces about 10K step-level pairs, and the preferred step is sampled from the model itself. After fewer than 500 training steps, Qwen2-72B-Instruct scores 70.8% on MATH and 94.0% on GSM8K, ahead of several proprietary systems. The work shows that fine-grained process supervision is possible without a separate reward model or a full RLHF pipeline.

Key points

  • Method: each training example is a math problem, the correct earlier steps, one chosen next step and one rejected next step. The DPO objective is applied only to that next step, not to the whole solution.
  • Dataset: about 10K step-wise preference pairs. Using the model's own corrected steps (in-distribution data) worked better than steps written by humans or GPT-4.
  • Efficiency: with fewer than 500 Step-DPO training steps, models with more than 70B parameters gain close to 3 points of accuracy on MATH.
  • Headline result: Qwen2-72B-Instruct + Step-DPO reaches 70.8% on MATH and 94.0% on GSM8K, beating GPT-4-1106, Claude-3-Opus and Gemini-1.5-Pro. Gains are also reported for Qwen2-7B, Qwen2-57B-A14B, Qwen1.5-32B and Llama3-70B.
  • Resources: code, data and models are released at github.com/dvlab-research/Step-DPO. The authors are from CUHK, HIT (Shenzhen) and SmartMore.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Mathematics & statistics

Cited by

96 papers of our library cite it (of the 140673 whose bibliographies we read); 1 of them have a page here, 95 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.48550/arxiv.2406.18629 · arXiv 2406.18629

@misc{lai2024step,
  title = {{Step-DPO: Step-wise Preference Optimization for Long-chain Reasoning of LLMs}},
  author = {Lai, Xin and Tian, Zhuotao and Chen, Yukang and Yang, Senqiao and Peng, Xiangru and Jia, Jiaya},
  year = {2024},
  doi = {10.48550/arxiv.2406.18629},
  eprint = {2406.18629},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.48550/arxiv.2406.18629}
}

References

5 references, 4 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. Josh Achiam, Steven Adler, Sandhini Agarwal, Lama Ahmad, Ilge Akkaya, Florencia Leoni Aleman, Diogo Almeida, Janko Altenschmidt, Sam Altman, Shyamal Anadkat, et al. Gpt-4 technical report. arXiv:2303.08774, 2023. find our card
  2. Zhangir Azerbayev, Hailey Schoelkopf, Keiran Paster, Marco Dos Santos, Stephen McAleer, Albert Q Jiang, Jia Deng, Stella Biderman, and Sean Welleck. Llemma: An open language model for mathematics. arXiv:2310.10631, 2023. find our card
  3. Jinze Bai, Shuai Bai, Yunfei Chu, Zeyu Cui, Kai Dang, Xiaodong Deng, Yang Fan, Wenbin Ge, Yu Han, Fei Huang, Binyuan Hui, Luo Ji, Mei Li, Junyang Lin, Runji Lin, Dayiheng Liu, Gao Liu, Chengqiang Lu, Keming Lu, Jianxin Ma, Rui Men, Xingzhang Ren, Xuancheng Ren, Chuanqi Tan, Sinan Tan, Jianhong Tu, P… find our card
  4. Guoxin Chen, Minpeng Liao, Chengxi Li, and Kai Fan. Alphamath almost zero: process supervision without process. arXiv:2405.03553, 2024. find our card
  5. Paul F Christiano, Jan Leike, Tom Brown, Miljan Martic, Shane Legg, and Dario Amodei. Deep reinforcement learning from human preferences. NeurIPS, 2017. find