Bohan Lin
Author directory2026
PAPO: Stabilizing Rubric Integration Training via Decoupled Advantage Normalization
Zelin Tan | Zhouliang Yu | Bohan Lin | Zijie Geng | Hejia Geng | Yudong Zhang | Mulei Zhang | Yang Chen | Shuyue Hu | Zhenfei Yin | Chen Zhang | Lei Bai
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zelin Tan | Zhouliang Yu | Bohan Lin | Zijie Geng | Hejia Geng | Yudong Zhang | Mulei Zhang | Yang Chen | Shuyue Hu | Zhenfei Yin | Chen Zhang | Lei Bai
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
We propose Process-Aware Policy Optimization (PAPO), a method that integrates process-level evaluation into Group Relative Policy Optimization (GRPO) through **decoupled advantage normalization**, to address two limitations of existing reward designs. Outcome reward models (ORM) evaluate only final-answer correctness, treating all correct responses identically, and gradually lose the advantage signal as groups become uniformly correct. Rubric-based process reward models (PRM) offer richer supervision, differentiating quality among correct responses and restoring advantage diversity, but using their scores as rewards triggers verbosity-driven reward hacking and accuracy collapse. PAPO resolves both by composing the advantage from an outcome advantage Aout, derived from outcome reward rout over all responses, and a process advantage Aproc, derived from process reward rproc exclusively over the correct subset. Aout anchors correctness, and correct subset normalization on Aproc rules out verbosity-driven hacking while sustaining the gradient on all-correct groups where ORM exhausts. PAPO consistently outperforms ORM across five model configurations and six benchmarks (reaching 51.3% vs. 46.3% on OlympiadBench for Qwen2.5-7B while continuing to improve as ORM plateaus and declines), with analogous gains when composed with mainstream GRPO variants.
AgentAsk: Multi-Agent Systems Need to Ask
Bohan Lin | Kuo Yang | Zelin Tan | Yingchuan Lai | Chen Zhang | Guibin Zhang | Xinlei Yu | Miao Yu | Xu Wang | Yudong Zhang | Yang Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Bohan Lin | Kuo Yang | Zelin Tan | Yingchuan Lai | Chen Zhang | Guibin Zhang | Xinlei Yu | Miao Yu | Xu Wang | Yudong Zhang | Yang Wang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Multi-agent systems (MAS) built on large language models promise improved problem-solving through collaboration, yet they often fail to consistently outperform strong single-agent baselines due to error propagation at inter-agent message handoffs. In this work, we conduct a systematic empirical analysis of such failures and introduce an edge-level error taxonomy that identifies four dominant error types: Data Gap, Signal Corruption, Referential Drift, and Capability Gap, as primary sources of failure in multi-agent interactions. Building on this taxonomy, we propose AgentAsk, a lightweight clarification module designed to intervene at the edge level in MAS to prevent cascading errors. The module operates by strategically applying minimal clarifications at critical points within the system, improving the accuracy and efficiency of the overall task. AgentAsk is trained to balance the trade-offs between clarification cost, latency, and accuracy, while it is also architecture-agnostic and can be easily integrated into existing systems. Evaluated across five benchmarks, AgentAsk consistently improves accuracy by up to 4.69%, while keeping latency and extra costs below 10% compared to baseline MAS, showcasing its high efficiency and minimal overhead. The code is available at https://anonymous.4open.science/r/AgentAsk-3432.