Wei Yang
Author directoryOther people with similar names: Wei Yang, Wei Yang
Unverified author pages with similar names: Wei Yang
2026
Auditing Multi-Agent LLM Reasoning Trees Outperforms Majority Vote and LLM-as-Judge
Wei Yang | Shixuan Li | Gengshuo Liu | Heng Ping | Peiyu Zhang | Paul Bogdan | Jesse Thomason
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Wei Yang | Shixuan Li | Gengshuo Liu | Heng Ping | Peiyu Zhang | Paul Bogdan | Jesse Thomason
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Multi-agent systems (MAS) can substantially extend the reasoning capacity of large language models (LLMs). Most MAS frameworks aggregate agent outputs via simple majority voting, discarding the evidential structure of reasoning traces. Majority voting is brittle under confabulation consensus, where agents share correlated biases and converge on the same incorrect rationale. We introduce AgentAuditor, which moves beyond frequency-based aggregation by organizing agent traces into a Reasoning Tree that explicitly represents agreements and divergences in their reasoning. AgentAuditor resolves conflicts by comparing branch-level evidence at critical divergence points, turning global adjudication into efficient, localized verification. We further propose Anti-Consensus Preference Optimization (ACPO), which trains the adjudicator with evidence-verified preference supervision to reduce conformity to misleading majority cues. Across four MAS frameworks and multiple reasoning benchmarks, AgentAuditor consistently improves aggregation performance over majority voting, with gains of up to 5% absolute accuracy while remaining token-efficient.
Tournament-GRPO: Group-Wise Tournament Rewards for Reinforcement Learning in Open-Ended Long-Form Generation
Zixuan Yang | Yiqun Chen | Wei Yang | Erhan Zhang | Zihan Shen | Xiaochi Wei | Yan Gao | Yi Wu | Yao Hu | Jiaxin Mao
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zixuan Yang | Yiqun Chen | Wei Yang | Erhan Zhang | Zihan Shen | Xiaochi Wei | Yan Gao | Yi Wu | Yao Hu | Jiaxin Mao
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Reinforcement learning in open-ended long-form generation is challenging because reliable reference answers and automatic metrics are often unavailable. Existing rubric-based methods typically rely on pointwise LLM-as-a-judge scoring, but absolute scores are difficult to calibrate across complex responses, may provide weak discrimination among same-query rollouts, and can become saturated during optimization. We propose Tournament-GRPO, a group-wise reward framework that converts rubric-guided LLM judgments into relative rewards through repeated multi-round tournaments among same-query rollouts. Tournament-GRPO compares candidates within groups, accumulates tournament outcomes, and normalizes them into group-wise rewards for GRPO training. Experiments on Deep Research Bench show that Tournament-GRPO consistently outperforms existing reward-design baselines, achieving a 4.52-point overall-score improvement over the strongest baseline. Further analyses show that tournament rewards provide a favorable effectiveness–efficiency trade-off and that tournament design affects training dynamics. These results suggest that rubric-guided tournament comparison provides an effective reward signal for reinforcement learning in open-ended long-form generation.