Yao Tong
Author directory2026
From Harm to Help: Turning Reasoning In-Context Demos into Assets for Reasoning LMs
Weida Liang | Zihang Fu | Haonan Wang | Zheng Nie | Yifan Zhang | Yao Tong | Tongyao Zhu | Hao Jiang | Chuang Li | Jiaying Wu | Kenji Kawaguchi
Findings of the Association for Computational Linguistics: EMNLP 2026
Weida Liang | Zihang Fu | Haonan Wang | Zheng Nie | Yifan Zhang | Yao Tong | Tongyao Zhu | Hao Jiang | Chuang Li | Jiaying Wu | Kenji Kawaguchi
Findings of the Association for Computational Linguistics: EMNLP 2026
Recent reasoning LLMs (RLMs), especially those trained with verifier-based reinforcement learning, often perform worse with few-shot CoT than with direct answering. We revisit this paradox using high-quality reasoning traces from DeepSeek-R1 as demonstrations and find that adding more exemplars consistently degrades accuracy, even when demonstrations are optimal. A detailed analysis reveals two mechanisms behind this decline: (i) *semantic misguidance*, where high textual similarity leads the model to treat the target as the same as the exemplar and to copy intermediate steps verbatim; and (ii) *strategy transfer failure*, where the model struggles to extract useful reasoning strategies and apply them to target questions. Guided by these findings, we introduce Insight-to-Solve (I2S), which converts demonstrations into target-conditioned insights before solving, and I2S+, which adds iterative refinement. Across open- and closed-source models, both variants outperform direct answering and sequential test-time baselines. On a frozen 500-problem Omni-MATH transfer set, I2S+ improves R1-Distill-Qwen-7B and Qwen3-14B by +4.2 and +4.0 points, respectively. The same prompt stack also transfers to GPT-4.1, o1-mini, and R1-Distill-Llama-8B, showing that reasoning demonstrations can be converted from liabilities into useful test-time guidance.
2025
Cut the Deadwood Out: Backdoor Purification via Guided Module Substitution
Yao Tong | Weijun Li | Xuanli He | Haolan Zhan | Qiongkai Xu
Findings of the Association for Computational Linguistics: EMNLP 2025
Yao Tong | Weijun Li | Xuanli He | Haolan Zhan | Qiongkai Xu
Findings of the Association for Computational Linguistics: EMNLP 2025
Model NLP models are commonly trained (or fine-tuned) on datasets from untrusted platforms like HuggingFace, posing significant risks of data poisoning attacks. A practical yet underexplored challenge arises when such backdoors are discovered after model deployment, making retraining-required defenses less desirable due to computational costs and data constraints. In this work, we propose Guided Module Substitution (GMS), an effective retraining-free method based on guided merging of the victim model with a single proxy model. Specifically, GMS selectively replaces modules in the victim model based on a trade-off signal between utility and backdoor. GMS offers four desirable properties: (1) robustness to the choice and trustworthiness of the proxy model, (2) applicability under relaxed data assumptions, (3) stability across hyperparameters, and (4) transferability across different attacks. Extensive experiments on encoder models and decoder LLMs demonstrate the strong effectiveness of GMS. GMS significantly outperforms even the strongest defense baseline, particularly against challenging attacks like LWS.