Xu Guo
Author directoryOther people with similar names: Xu Guo
Unverified author pages with similar names: Xu Guo
2026
When Does Generating More Help? Disentangling Fixed-Source Synthesis from Source Expansion in Synthetic Data Scaling
Xu Guo | Jian Tong | Zhihui Lu | Qipeng Guo
Findings of the Association for Computational Linguistics: EMNLP 2026
Xu Guo | Jian Tong | Zhihui Lu | Qipeng Guo
Findings of the Association for Computational Linguistics: EMNLP 2026
Synthetic data can be scaled along two routes: Source Expansion (SE), which enlarges the source by adding seed materials or generators, and Fixed-Source Synthesis (FSS), which holds the source fixed and scales the generation budget. Existing scaling studies typically expand the source as the data grows, conflating SE with FSS and leaving FSS underexplored. We isolate FSS within a standard rejection sampling (RS) pipeline and derive a scaling form for it from how repeated sampling covers a fixed source. Empirically, fit on low budgets, the form predicts performance at the held-out highest budget for every evaluated teacher–student pair. At matched total-sample budgets, SE and FSS are comparable at small budgets, but adding seed questions outperforms spending the same budget on more responses at large budgets. Within FSS, neither synthesizing additional questions from the existing seeds nor varying the synthesis protocol consistently outperforms plain RS across matched budgets. FSS is thus a bounded scaling axis and a controlled setting for comparing synthesis protocols. We will release our code and data to facilitate further research.
Rethinking Multiple-Choice Questions for RLVR: Unlocking Potential via Distractor Design
Xu Guo | Qiming Ge | Jian Tong | Kedi Chen | Jin Zhang | Xiaogui Yang | Xuan Gao | Haijun Lv | Zhihui Lu | Yicheng Zou | Qipeng Guo
Findings of the Association for Computational Linguistics: ACL 2026
Xu Guo | Qiming Ge | Jian Tong | Kedi Chen | Jin Zhang | Xiaogui Yang | Xuan Gao | Haijun Lv | Zhihui Lu | Yicheng Zou | Qipeng Guo
Findings of the Association for Computational Linguistics: ACL 2026
Reinforcement Learning with Verifiable Rewards (RLVR) significantly enhances the reasoning capabilities of Large Language Models. When applied to RLVR, Multiple-Choice Questions (MCQs) offer a scalable source of verifiable data but risk inducing reward hacking, where models shortcut reasoning via random guessing or simple elimination. Current approaches often mitigate this by converting MCQs to open-ended formats, thereby discarding the contrastive signal provided by expert-designed distractors. In this work, we systematically investigate the impact of option design on RLVR. Our analysis highlights two primary insights: (1) Mismatches in option counts between training and testing degrade performance. (2) Strong distractors effectively mitigate random guessing, enabling effective RLVR training even with 2-way questions. Motivated by these findings, we propose Iterative Distractor Curation (IDC), a framework that actively constructs high-quality distractors to block elimination shortcuts and promote deep reasoning. Experiments on various benchmarks demonstrate that our method effectively enhances distractor quality and yields significant gains in RLVR training compared to the original data.