Papers by Zhaoyu Li
LongLeader: A Comprehensive Leaderboard for Large Language Models in Long-context Scenarios (2025.naacl-long)
Copied to clipboard
Pei Chen, Hongye Jin, Cheng-Che Lee, Rulin Shao, Jingfeng Yang, Mingyu Zhao, Zhaoyu Zhang, Qin Lu, Kaiwen Men, Ning Xie, Huasheng Li, Bing Yin, Han Li, Lingyun Wang
| Challenge: | LongLeader aims to assess different LLMs' long-context comprehension abilities . long-constext comprehension is a key bottleneck for many use cases . |
| Approach: | They propose a leaderboard to assess different LLMs' long-context comprehension abilities . they offer open-source access to the benchmarks and maintain a dedicated website . |
| Outcome: | The proposed model assesses different LLMs on selected benchmarks and provides open-source access to the benchmarks. |
APPL: A Prompt Programming Language for Harmonious Integration of Programs and Large Language Model Prompts (2025.acl-long)
Copied to clipboard
Honghua Dong, Qidong Su, Yubo Gao, Zhaoyu Li, Yangjun Ruan, Gennady Pekhimenko, Chris J. Maddison, Xujie Si
| Challenge: | Large Language Models (LLMs) are capable of handling diverse tasks with well-crafted prompts and integration of external tools. |
| Approach: | They propose a prompt programming language that acts as a bridge between computer programs and LLMs by providing convenient conventions between them. |
| Outcome: | The proposed language is intuitive, concise, and efficient through representative scenarios including Chain-of-Thought with self-consistency (CoT-SC) and ReAct tool-use agent. |
Saber: Efficient Sampling with Adaptive Acceleration and Backtracking Enhanced Remasking for Diffusion Language Model in Code Generation (2026.acl-long)
Copied to clipboard
| Challenge: | Diffusion language models (DLMs) offer advantages in parallel generation and bidirectional context modeling, but they face a critical trade-off between inference speed and output quality for tasks with strict structural constraints such as code generation. |
| Approach: | They propose an efficient sampling algorithm that reduces the number of tokens unmasked per step based on the model’s evolving confidence. |
| Outcome: | The proposed method improves Pass@1 accuracy by 1.9% while achieving 251.4% inference speedup. |