Junbo Fu
2026
Duplicate-Aware Controlled Code Generation: Enhancing Copyright Protection with Targeted Reordering Beam Search in LLMs
Junbo Fu | Guoshuai Zhao | Linkang Yang | Yunqi Mi | Xueming Qian
Findings of the Association for Computational Linguistics: ACL 2026
Junbo Fu | Guoshuai Zhao | Linkang Yang | Yunqi Mi | Xueming Qian
Findings of the Association for Computational Linguistics: ACL 2026
The increasing integration of large language models (LLMs) in code generation has raised critical copyright concerns, particularly regarding the verbatim repetition of copyrighted code. To address this challenge, we propose a novel task: Duplicate-Aware Controlled Code Generation (DACCG), which aims to mitigate verbatim repetition while preserving the quality of generated code. To this end, we introduce Targeted Reordering Beam Search (TRBS), a plug-and-play decoding method that dynamically reorders beam candidates to reduce direct copying. TRBS leverages the FM-index for efficient substring detection and employs a spike-entropy-based protection mechanism to safeguard structural anchors critical to code coherence. Experimental results on a multi-language code generation benchmark demonstrate that TRBS effectively reduces verbatim repetition while maintaining functional adequacy. Our research represents a pioneering effort in code copyright protection from the model user’s perspective, offering novel insights into responsible code generation practices.
2024
Learning to Paraphrase for Alignment with LLM Preference
Junbo Fu | Guoshuai Zhao | Yimin Deng | Yunqi Mi | Xueming Qian
Findings of the Association for Computational Linguistics: EMNLP 2024
Junbo Fu | Guoshuai Zhao | Yimin Deng | Yunqi Mi | Xueming Qian
Findings of the Association for Computational Linguistics: EMNLP 2024
Large Language Models (LLMs) exhibit the issue of paraphrase divergence. This means that when a question is phrased in a slightly different but semantically similar way, LLM may output a wrong response despite being able to answer the original question correctly. Previous research has regarded this issue as a problem of the model’s robustness to question paraphrase and proposed a retraining method to address it. However, retraining faces challenges in meeting the computational costs and privacy security demands of LLMs. In this paper, we regard this issue as a problem of alignment with model preferences and propose PEARL (Preference-drivEn pAraphRase Learning). This is a black-box method that enhances model performance by paraphrasing questions in expressions preferred by the model. We validate PEARL across six datasets spanning three tasks: open-domain QA, commonsense reasoning, and math word problem. Extensive experiments demonstrated not only the outstanding performance but also the composability, transferability, and immense potential of PEARL, shedding new light on the black-box tuning of LLMs.