Probability-Consistent Preference Optimization for Enhanced LLM Reasoning
Recent advances in preference optimization have demonstrated significant potential for improving mathematical reasoning capabilities in large language models (LLMs).While current approaches leverage high-quality pairwise preference data through outcome-based criteria like answer correctness or consistency, they fundamentally neglect the internal logical coherence of responses.To overcome this, we propose Probability-Consistent Preference Optimization (PCPO), a novel framework that establishes dual quantitative metrics for preference selection: (1) surface-level answer correctness and (2) intrinsic token-level probability consistency across responses.Extensive experiments show that our PCPO consistently outperforms existing outcome-only criterion approaches across a diverse range of LLMs and benchmarks.Our code is publicly available at https://github.com/YunqiaoYang/PCPO.
Authors
- Yunqiao Yang (ORCID: https://orcid.org/0000-0003-0109-8903)
- Aojun Zhou (ORCID: https://orcid.org/0000-0002-4742-8624)
- Weikang Shi
- Zimu Lu (ORCID: https://orcid.org/0000-0001-8479-2807)
- Mingjie Zhan (ORCID: https://orcid.org/0000-0001-8221-9089)
- Houxing Ren
- Junting Pan
- Ke Wang (ORCID: https://orcid.org/0000-0001-5354-793X)
- Hongsheng Li (ORCID: https://orcid.org/0009-0003-4821-5051)
Publication Details
- Published
- 2025-01-01
- DOI
- https://doi.org/10.18653/v1/2025.findings-acl.333
- Primary Topic
- Semantic Web and Ontologies
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Innovation and Technology Commission
- Chinese University of Hong Kong