Efficient Process Reward Modeling via Contrastive Mutual Information

Nakyung Lee, Sangwoo Hong, Jungwoo Lee


Abstract
Recent research has devoted considerable effort to verifying the intermediate reasoning steps of chain-of-thought (CoT) trajectories using process reward models (PRMs) and other verifier models. However, training a PRM typically requires human annotators to assign reward scores to each reasoning step, which is both costly and time-consuming. Existing automated approaches, such as Monte Carlo (MC) estimation, also demand substantial computational resources due to repeated LLM rollouts. To overcome these limitations, we propose **contrastive pointwise mutual information (CPMI)**, a novel automatic reward labeling method that leverages the model’s internal probability to infer step-level supervision while significantly reducing the computational burden of annotating dataset. CPMI quantifies how much a reasoning step increases the **mutual information** between the step and the correct target answer relative to hard-negative alternatives. This **contrastive** signal serves as a proxy for the step’s contribution to the final solution and yields a reliable reward. The experimental results show that CPMI-based labeling reduces dataset construction time by **84%** and token generation by **98%** compared to MC estimation, while achieving higher accuracy on process-level evaluations and mathematical reasoning benchmarks.
Anthology ID:
2026.acl-long.1744
Volume:
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Month:
July
Year:
2026
Address:
San Diego, California, United States
Editors:
Maria Liakata, Viviane P. Moreira, Jiajun Zhang, David Jurgens
Venue:
ACL
SIG:
Publisher:
Association for Computational Linguistics
Note:
Pages:
37603–37617
Language:
URL:
https://preview.aclanthology.org/ingest-acl/2026.acl-long.1744/
DOI:
Bibkey:
Cite (ACL):
Nakyung Lee, Sangwoo Hong, and Jungwoo Lee. 2026. Efficient Process Reward Modeling via Contrastive Mutual Information. In Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 37603–37617, San Diego, California, United States. Association for Computational Linguistics.
Cite (Informal):
Efficient Process Reward Modeling via Contrastive Mutual Information (Lee et al., ACL 2026)
Copy Citation:
PDF:
https://preview.aclanthology.org/ingest-acl/2026.acl-long.1744.pdf
Checklist:
 2026.acl-long.1744.checklist.pdf