Papers by Yihong Huang
G-LoRA: Global-Local Decoupled Low-Rank Adaptation (2026.findings-acl)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) improves the fine-tuning efficiency and performance of large language models. |
| Approach: | They propose a low-rank adaptive approach that decomposes update matrix into global and local adapters and assigns them to local and global adapters. |
| Outcome: | The proposed method achieves up to 2.7% accuracy improvement over LoRA and its variants on commonsense reasoning, mathematical reasoning, and code generation. |
DevEval: A Manually-Annotated Code Generation Benchmark Aligned with Real-World Code Repositories (2024.findings-acl)
Copied to clipboard
Jia Li, Ge Li, Yunfei Zhao, Yongmin Li, Huanyu Liu, Hao Zhu, Lecheng Wang, Kaibo Liu, Zheng Fang, Lanshen Wang, Jiazheng Ding, Xuanming Zhang, Yuqi Zhu, Yihong Dong, Zhi Jin, Binhua Li, Fei Huang, Yongbin Li, Bin Gu, Mengfei Yang
| Challenge: | Existing benchmarks are poorly aligned with real-world code repositories and are insufficient to evaluate the coding abilities of Large Language Models (LLMs). |
| Approach: | They propose a repository-level benchmark named DevEval to evaluate LLMs' coding abilities in real-world code repositories. |
| Outcome: | The proposed benchmarks show that the LLMs perform better in real-world code repositories than existing benchmarks. |
ZoomRAG: Hierarchical Random-walk Zooming across Multi-scale Information Graphs for Fast and Accurate RAG (2026.findings-acl)
Copied to clipboard
Xianming Hu, Jingyang Chen, Bin Tang, Yihe Liu, Yihong Huang, Hongbo Zhao, Nuoyi Chen, Jie Zhang, Ping Li, Kai Zhang
| Challenge: | retrieval-augmented generation (RAG) is a powerful tool for NLP applications . but it is challenging to encode large knowledge bases as compact offline structures . |
| Approach: | They propose a coarse-to-fine hierarchical graph inference method that uses random walks to retrieve information from a corpus of documents. |
| Outcome: | The proposed method reduces offline indexing costs and accelerates retrieval. |
Enhancing Personalized Dialogue Generation with Contrastive Latent Variables: Combining Sparse and Dense Persona (2023.acl-long)
Copied to clipboard
| Challenge: | Existing personalized dialogue agents model persona profiles from sparse or dense persona descriptions and dialogue histories. |
| Approach: | They propose a model that clusters dense persona descriptions into sparse categories and generates personalized responses from dialogue histories. |
| Outcome: | The proposed model improves on Chinese and English datasets. |
LLM-Powered Test Case Generation for Detecting Bugs in Plausible Programs (2025.acl-long)
Copied to clipboard
Kaibo Liu, Zhenpeng Chen, Yiyang Liu, Jie M. Zhang, Mark Harman, Yudong Han, Yun Ma, Yihong Dong, Ge Li, Gang Huang
| Challenge: | TrickCatcher generates test cases that pass existing tests yet contain bugs . a recent study found that tricky bugs are not detected by test suites . |
| Approach: | They propose an LLM-powered approach to generating test cases for uncovering bugs in plausible programs . they use a PUT and specification to generate program variants, an input generator and an Llm to construct test inputs . |
| Outcome: | The proposed approach achieves recall, precision, and F1 scores that are 1.80, 2.65, and 1.66 . trickCatcher generates program variants based on the program under test and its specification . |
Adaptive Zooming via Relevance-Informed Positional Resource Allocation for Training-free LLM Context Extension (2026.findings-acl)
Copied to clipboard
Hongbo Zhao, Huibin Wang, Bin Tang, Xianming Hu, Yihong Huang, Yijun Shen, Nuoyi Chen, Ping Li, Kai Zhang
| Challenge: | Existing training-free methods for extrapolating beyond training context lengths are semantics-agnostic . Existing methods that focus on relative token distances can indiscriminately blur semantically relevant and irrelevant tokens . |
| Approach: | They propose an adaptive positional zooming method that uses semantic relevance to extrapolate beyond training context lengths. |
| Outcome: | Experiments show that RiPRA outperforms existing training-free extrapolation methods . relevant tokens get higher positional resolution, while irrelevant tokens are compressed . |
ConvGQR: Generative Query Reformulation for Conversational Search (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods to determine a good search query from the whole conversation context are expensive and often lead to sub-optimal results. |
| Approach: | They propose a framework to reformulate conversational queries based on generative pre-trained language models (PLMs) they propose generative knowledge infusion mechanism to optimize query reformulation and retrieval. |
| Outcome: | Extensive experiments on four conversational search datasets demonstrate the effectiveness of ConvGQR. |
RL-PLUS: Countering Capability Boundary Collapse of LLMs in Reinforcement Learning with Hybrid-policy Optimization (2026.acl-long)
Copied to clipboard
Yihong Dong, Xue Jiang, Yongding Tao, Huanyu Liu, Kechi Zhang, Lili Mou, Rongyu Cao, Yingwei MA, Jue Chen, Binhua Li, Zhi Jin, Fei Huang, Yongbin Li, Ge Li
| Challenge: | Reinforcement Learning with Verifiable Reward (RLVR) has significantly advanced the complex reasoning abilities of Large Language Models (LLMs). |
| Approach: | They propose a hybrid-policy optimization approach that synergizes internal exploitation with external data to achieve stronger reasoning capabilities. |
| Outcome: | The proposed approach achieves state-of-the-art performance on six math reasoning benchmarks and superior performance on out-of distribution reasoning tasks. |