Chunhua Liao
2026
Beyond Code Pairs: Dialogue-Based Data Generation for LLM Code Translation
Le Chen | Nuo Xu | Winson Chen | Bin Lei | Pei-Hung Lin | Dunzhi Zhou | Rajeev Thakur | Caiwen Ding | Ali Jannesari | Chunhua Liao
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Le Chen | Nuo Xu | Winson Chen | Bin Lei | Pei-Hung Lin | Dunzhi Zhou | Rajeev Thakur | Caiwen Ding | Ali Jannesari | Chunhua Liao
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Large language models (LLMs) have shown remarkable capabilities in code translation, yet their performance deteriorates in low-resource programming domains such as Fortran and emerging frameworks like CUDA, where high-quality parallel data are scarce. We present an automated dataset generation pipeline featuring a dual-LLM Questioner–Solver design that incorporates external knowledge from compilers and runtime feedback. Beyond traditional source–target code pair datasets, our approach additionally generates (1) verified translations with unit tests for assessing functional consistency, and (2) multi-turn dialogues that capture the reasoning process behind translation refinement. Applied to Fortran→C++ and C++→CUDA, the pipeline yields 3.64k and 3.93k dialogues, respectively. Fine-tuning on this data yields dramatic improvements in functional correctness, boosting unit test success rates by over 56% on the challenging C++-to-CUDA task. We show that the generated data enables a 7B open-weight model to significantly outperform larger proprietary systems on key metrics like compilation success.
2025
REALM: Recursive Relevance Modeling for LLM-based Document Re-Ranking
Pinhuan Wang | Zhiqiu Xia | Chunhua Liao | Feiyi Wang | Hang Liu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Pinhuan Wang | Zhiqiu Xia | Chunhua Liao | Feiyi Wang | Hang Liu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Large Language Models (LLMs) have shown strong capabilities in document re-ranking, a key component in modern Information Retrieval (IR) systems. However, existing LLM-based approaches face notable limitations, including ranking uncertainty, unstable top-k recovery, and high token cost due to token-intensive prompting. To effectively address these limitations, we propose REALM, an uncertainty-aware re-ranking framework that models LLM-derived relevance as Gaussian distributions and refines them through recursive Bayesian updates. By explicitly capturing uncertainty and minimizing redundant queries, REALM achieves better rankings more efficiently. Experimental results demonstrate that our REALM surpasses state-of-the-art re-rankers while significantly reducing token usage and latency, improving NDCG@10 by 0.7-11.9 and simultaneously reducing the number of LLM inferences by 23.4-84.4%, promoting it as the next-generation re-ranker for modern IR systems.