Yuxiang Chen
2026
A Comprehensive Survey of Process Reward Models: Data Generation, Model Construction, and Usage
Congmin Zheng | Jiachen Zhu | Zhuoying Ou | Yuxiang Chen | Kangning Zhang | Rong Shan | Zeyu Zheng | Mengyue Yang | Jianghao Lin | Yong Yu | Weinan Zhang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Congmin Zheng | Jiachen Zhu | Zhuoying Ou | Yuxiang Chen | Kangning Zhang | Rong Shan | Zeyu Zheng | Mengyue Yang | Jianghao Lin | Yong Yu | Weinan Zhang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large Language Models (LLMs) have advanced reasoning ability, yet conventional alignment remains dominated by outcome reward models (ORMs) that judge only final answers. Process Reward Models(PRMs) address this gap by evaluating and guiding reasoning at the step or trajectory level. This survey provides a systematic overview of PRMs through the full loop: how to generate process data, build PRMs, and use PRMs for test-time scaling and reinforcement learning. We summarize applications across math, code, text, multimodal reasoning, robotics, and agents, and review emerging benchmarks. Our goal is to clarify design spaces, reveal open challenges, and guide future research toward fine-grained, robust reasoning alignment.
2022
Syntactically Robust Training on Partially-Observed Data for Open Information Extraction
Ji Qi | Yuxiang Chen | Lei Hou | Juanzi Li | Bin Xu
Findings of the Association for Computational Linguistics: EMNLP 2022
Ji Qi | Yuxiang Chen | Lei Hou | Juanzi Li | Bin Xu
Findings of the Association for Computational Linguistics: EMNLP 2022
Open Information Extraction models have shown promising results with sufficient supervision. However, these models face a fundamental challenge that the syntactic distribution of training data is partially observable in comparison to the real world. In this paper, we propose a syntactically robust training framework that enables models to be trained on a syntactic-abundant distribution based on diverse paraphrase generation. To tackle the intrinsic problem of knowledge deformation of paraphrasing, two algorithms based on semantic similarity matching and syntactic tree walking are used to restore the expressionally transformed knowledge. The training framework can be generally applied to other syntactic partial observable domains. Based on the proposed framework, we build a new evaluation set called CaRB-AutoPara, a syntactically diverse dataset consistent with the real-world setting for validating the robustness of the models. Experiments including a thorough analysis show that the performance of the model degrades with the increase of the difference in syntactic distribution, while our framework gives a robust boundary.