Yueqin Yin
Author directory2026
Mitigating Exploration Bias in RL for Multi-Instruction Following
Mian Zhang | Yueqin Yin | Kaiyu He | Peilin Wu | Xinlu Zhang | Mingyuan Zhou | Zhiyu Chen
Findings of the Association for Computational Linguistics: EMNLP 2026
Mian Zhang | Yueqin Yin | Kaiyu He | Peilin Wu | Xinlu Zhang | Mingyuan Zhou | Zhiyu Chen
Findings of the Association for Computational Linguistics: EMNLP 2026
RL has emerged as a powerful paradigm for enhancing the instruction following capabilities of LLMs. While existing training recipes achieve substantial gains, we find that they suffer from **exploration bias towards easy instructions** when the training data has multiple instructions in a prompt. This bias is caused by two main reasons: 1) **the policy model’s initial ability to satisfy hard instructions is too low** to trigger successful exploration during RL training, so the optimization is biased to easy instructions and 2) canonical RL training recipes typically employ a cumulative reward (the number of instructions fulfilled), **treating all the instructions equally**; the policy model is biased to fulfill the easy instructions to get the same amount of rewards. To address these, we first propose two metrics to measure the exploration bias of instruction following and then introduce a two-stage framework to alleviate it: 1) Behavioral Bootstrapping: a lightweight rejection sampling fine-tuning before RL to activate hard instructions and 2) Scarcity-Aware Rewards: a new RL reward function that assigns rewards to instructions based on their empirical scarcity. Experiments show that the proposed metrics are highly correlated with model performance and our methods unleash the potential of RL training: our best models outperform the baselines by a significant margin across three verifiable instruction following benchmarks.
ContextCheck: Sentence-Level Faithfulness Verification with Context-Aware Disambiguation
Yueqin Yin | Yaxi Li | Xin Liu | Xun Wang | Kaiqiang Song | Simin Ma | Shujian Liu | Sathish Reddy Indurthi | Haoyun Deng | Pengcheng He | Mingyuan Zhou | Song Wang
Findings of the Association for Computational Linguistics: ACL 2026
Yueqin Yin | Yaxi Li | Xin Liu | Xun Wang | Kaiqiang Song | Simin Ma | Shujian Liu | Sathish Reddy Indurthi | Haoyun Deng | Pengcheng He | Mingyuan Zhou | Song Wang
Findings of the Association for Computational Linguistics: ACL 2026
Large language models often hallucinate, producing content that is factually incorrect or not grounded in the sources. Reliable faithfulness verification is critical for trustworthy deployment. In the provided-source (closed-world) setting, existing verifiers either classify whole passages in one step or check sentences independently, overlooking cross-sentence context. We present ContextCheck, a framework for sentence-level faithfulness verification with context-aware disambiguation. Each sentence is verified against the grounding document while conditioning on preceding sentences, enabling pronouns and references to be resolved directly in context. This design avoids the separate decontextualization step of rewriting claims into self-contained forms, casting verification as a context-conditioned task. Fine-tuned from Llama-3.1-8B-Instruct, ContextCheck sets a new state of the art on three context-dependent datasets; it improves Macro F1 by over 10 points compared to the strongest baselines, and matches or slightly surpasses the strongest baselines on 14 standard single-sentence datasets compared to prior 8B-scale verifiers (average Macro F1 73.5 vs. 72.8). These results show that ContextCheck offers a practical and effective approach for sentence-level hallucination detection.
2025
KodCode: A Diverse, Challenging, and Verifiable Synthetic Dataset for Coding
Zhangchen Xu | Yang Liu | Yueqin Yin | Mingyuan Zhou | Radha Poovendran
Findings of the Association for Computational Linguistics: ACL 2025
Zhangchen Xu | Yang Liu | Yueqin Yin | Mingyuan Zhou | Radha Poovendran
Findings of the Association for Computational Linguistics: ACL 2025
We introduce KodCode, a synthetic dataset that addresses the persistent challenge of acquiring high-quality, verifiable training data across diverse difficulties and domains for training Large Language Models for coding. Existing code-focused resources typically fail to ensure either the breadth of coverage (e.g., spanning simple coding tasks to advanced algorithmic problems) or verifiable correctness (e.g., unit tests). In contrast, KodCode comprises question–solution–test triplets that are systematically validated via a self-verification procedure. Our pipeline begins by synthesizing a broad range of coding questions, then generates solutions and test cases with additional attempts allocated to challenging problems. Finally, post-training data synthesis is done by rewriting questions into diverse formats and generating responses under a test-based reject sampling procedure from a reasoning model (DeepSeek R1). This pipeline yields a large-scale, robust and diverse coding dataset. It is suitable for supervised fine-tuning and the paired unit tests also provide great potential for RL tuning. Fine-tuning experiments on coding benchmarks (HumanEval(+), MBPP(+), BigCodeBench, and LiveCodeBench) demonstrate that KodCode-tuned models achieve state-of-the-art performance, surpassing models like Qwen2.5-Coder-32B-Instruct and DeepSeek-R1-Distill-Llama-70B.