Longfei Zheng
Author directory2026
Reinforcement Learning with Semantic Rewards Enables Low-Resource Language Expansion without Alignment Tax
Zeli Su | Ziyin Zhang | Zhou Liu | Xuexian Song | Zhankai Xu | Longfei Zheng | Xiaolu Zhang | Rong Fu | Guixian Xu | Wentao Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Zeli Su | Ziyin Zhang | Zhou Liu | Xuexian Song | Zhankai Xu | Longfei Zheng | Xiaolu Zhang | Rong Fu | Guixian Xu | Wentao Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Extending large language models (LLMs) to low-resource languages often incurs an “align- ment tax”: improvements in the target lan- guage come at the cost of catastrophic forget- ting in general capabilities. We argue that this trade-off arises from the rigidity of supervised fine-tuning (SFT), which enforces token-level surface imitation on narrow and biased data distributions. To address this limitation, we propose a semantic-space alignment paradigm powered by Group Relative Policy Optimiza- tion (GRPO), where the model is optimized us- ing embedding-level semantic rewards rather than likelihood maximization. This objective encourages meaning preservation through flex- ible realizations, enabling controlled updates that reduce destructive interference with pre- trained knowledge. We evaluate our approach on Tibetan–Chinese machine translation and Ti- betan headline generation. Experiments show that our method acquires low-resource capa- bilities while markedly mitigating alignment tax, preserving general competence more effec- tively than SFT. Despite producing less rigid surface overlap, semantic RL yields higher se- mantic quality and preference in open-ended generation, and few-shot transfer results indi- cate that it learns more transferable and ro- bust representations under limited supervision. Overall, our study demonstrates that reinforce- ment learning with semantic rewards provides a safer and more reliable pathway for inclusive low-resource language expansion.
Source-Grounded Semantic Reinforcement Learning for Low-Resource Target-Language Generation
Zeli Su | Ziyin Zhang | Pan Zewei | Zhou Liu | Dingcheng Huang | Dehan Li | Zhankai Xu | Longfei Zheng | Xiaolu Zhang | Jun Zhou | Wentao Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Zeli Su | Ziyin Zhang | Pan Zewei | Zhou Liu | Dingcheng Huang | Dehan Li | Zhankai Xu | Longfei Zheng | Xiaolu Zhang | Jun Zhou | Wentao Zhang
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Low-resource target-language generation is often limited by scarce parallel data, while high-resource source-language monolingual data is abundant but difficult to use with standard supervised fine-tuning. We propose Source-Grounded Semantic Reinforcement Learning (SG-SRL), a resource-utilization framework that converts source-language monolingual data into cross-lingual semantic supervision. SG-SRL performs reference-free reinforcement learning (RL) on source-language data with a cross-lingual semantic reward, followed by lightweight supervised recovery. Although direct reward optimization induces verbosity-based reward hacking, recovery restores fluency, conciseness, and task format without erasing the learned semantic alignment. On Chinese-to-Thai generation, SG-SRL outperforms cold-start SFT, source-only continued pretraining, and synthetic-data SFT; human preference and training-independent metrics corroborate the gains. Recovery ablations further show that semantic retention and form restoration are jointly controlled by recovery data and intensity. An in-domain Chinese-to-Tibetan experiment shows that the reward interface can use a contrastively trained encoder when a capable multilingual reranker is unavailable, while also delimiting the framework’s dependence on reward-model discrimination.
The Evaluation Scaling Law: Toward More Reliable LLM Assessment via Multi-Prompt Diversity
Hongzhi Luan | Zhaoxin Huan | Linfeng Shi | Longfei Zheng | Xiaolu Zhang | Jun Zhou
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Hongzhi Luan | Zhaoxin Huan | Linfeng Shi | Longfei Zheng | Xiaolu Zhang | Jun Zhou
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Large Language Model (LLM) evaluation is frequently challenged by prompt sensitivity, which limits the reliability of benchmarks relying on a single template. To address this, we systematically investigate a multi-prompt evaluation framework that aggregates performance across diverse templates, leveraging a Quality-Diversity (QD) prompt selection mechanism to ensure both variety and fidelity. Through extensive empirical analysis, we uncover a novel Evaluation Scaling Law: evaluation reliability scales consistently with template diversity. Specifically, our experiments demonstrate that evaluation variance diminishes as the scale of prompts increases, while ranking monotonicity exhibits a log-linear improvement relative to the number of templates. By decoupling a model’s intrinsic capability from template-specific fluctuations, our framework facilitates more reliable assessments of LLMs, thereby providing a solid foundation for benchmarking that enables more effective monitoring of training dynamics and rigorous comparisons among state-of-the-art models.