Papers by Binhua Li
Plan-then-Seam: Towards Efficient Table-to-Text Generation (2023.findings-eacl)
Copied to clipboard
| Challenge: | Recent work explicitly decomposes the generation process into content planning and surface generation stages, employing two autoregressive networks for them respectively. |
| Approach: | They propose a non-parallelelizable table-to-text model that produces outputs in parallel with one network. |
| Outcome: | The proposed model achieves 3.0 5.6 times speedup for inference time, reducing 50% parameters, while maintaining as least comparable performance against strong two-stage table-to-text competitors. |
To Diff or Not to Diff? Structure-Aware and Adaptive Output Formats for Efficient LLM-based Code Editing (2026.findings-acl)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) are increasingly used for code editing, yet the full-code generation paradigm suffers from severe efficiency bottlenecks. |
| Approach: | They propose to use a structure-aware diff format to train LLMs to choose the most token-efficient format between a given diff format and full code. |
| Outcome: | The proposed approach matches the most token-efficient format with full-code generation while reducing latency and cost by over 30% on long-code editing tasks. |
Format-Adapter: Improving Reasoning Capability of LLMs by Adapting Suitable Format (2026.findings-acl)
Copied to clipboard
Dingzirui Wang, Xuanliang Zhang, Rongyu Cao, Longxu Dou, Xianzhen Luo, Yingwei MA, Qingfu Zhu, Binhua Li, Fei Huang, Yongbin Li
| Challenge: | Prior work showed that multiple reasoning formats outperform a single format when generating multiple answers. |
| Approach: | They propose a method to measure reasoning error when generating multiple answers . they propose 'formatadapter' which generates and selects suitable reasoning formats . |
| Outcome: | The proposed method achieves a 4.3% performance improvement over previous works on math and commonsense reasoning tasks. |
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. |
ExploraCoder: Advancing Code Generation for Multiple Unseen APIs via Planning and Chained Exploration (2025.acl-long)
Copied to clipboard
| Challenge: | Large language models face intrinsic limitations in coding with unseen APIs in training corpora. |
| Approach: | They propose a training-free framework that empowers LLMs to invoke multiple unseen APIs in code solution by planning a complex problem into several API invocation subtasks and experimenting with correct API usage at intermediate steps. |
| Outcome: | The proposed framework significantly improves performance for models lacking prior API knowledge, achieving 11.99% over retrieval-based approaches and 17.28% over pretraining-based methods in pass@10. |
STAR: SQL Guided Pre-Training for Context-dependent Text-to-SQL Parsing (2022.findings-emnlp)
Copied to clipboard
Zefeng Cai, Xiangyu Li, Binyuan Hui, Min Yang, Bowen Li, Binhua Li, Zheng Cao, Weijie Li, Fei Huang, Luo Si, Yongbin Li
| Challenge: | Extensive experiments show that STAR outperforms previous pre-training methods and ranks first on the leaderboard . text-to-SQL parsing aims to translate natural language (NL) questions into executable SQL queries . |
| Approach: | They propose a SQL guided pre-training framework STAR for context-dependent text-to-SQL parsing . they propose two objectives that explore context-dependence of NL utterances and SQL queries . |
| Outcome: | The proposed framework outperforms existing methods on two downstream benchmarks and ranks first on the leaderboard. |
Beyond Quantity: Trajectory Diversity Scaling for Code Agents (2026.findings-acl)
Copied to clipboard
Guhong Chen, Chenghao Sun, Cheng Fu, Qiyao Wang, Zhihong Huang, ChaoPeng Wei, Guangxu Chen, Feiteng Fang, Ahmadreza Argha, Bing Zhao, Xander Xu, Qi Han, Hamid Alinejad-Rokny, Qiang Qu, Binhua Li, Shiwen Ni, Min Yang, HU Wei, Yongbin Li
| Challenge: | Code large language models (LLMs) are becoming tool-interactive agents . quantity-centric scaling exhibits an early bottleneck that underutilizes trajectory data . et al.: a new approach to scale trajectory diversity improves tool-use generalization . |
| Approach: | They propose a Trajectory Diversity Scaling-based data synthesis framework for code agents that scales performance through diversity rather than raw volume. |
| Outcome: | Experiments on general tool-use benchmarks and code agent tasks show that TDScaling improves tool-user generalization and inherent coding proficiency. |
Induction Networks for Few-Shot Text Classification (D19-1)
Copied to clipboard
| Challenge: | Recent studies have used meta-learning to simulate the few-shot task . however, this sample-wise comparison may be severely disturbed by the various expressions in the same class. |
| Approach: | They propose a meta-learning-based induction network to learn a generalized class-wise representation of each class in a support set. |
| Outcome: | The proposed model outperforms existing state-of-the-art models on a sentiment and dialogue intent datasets. |
SUN: Exploring Intrinsic Uncertainties in Text-to-SQL Parsers (2022.coling-1)
Copied to clipboard
Bowen Qin, Lihan Wang, Binyuan Hui, Bowen Li, Xiangpeng Wei, Binhua Li, Fei Huang, Luo Si, Min Yang, Yongbin Li
| Challenge: | Existing methods that learn from multiple semantically-equivalent questions are limited to one-to-one mapping . |
| Approach: | They propose a constraint to explore the underlying complementary semantic information among multiple semantically-equivalent questions and learn robust feature representations with reduced spurious associations. |
| Outcome: | The proposed method outperforms strong competitors and achieves state-of-the-art results on five benchmark datasets. |
Dynamic Memory Induction Networks for Few-Shot Text Classification (2020.acl-main)
Copied to clipboard
| Challenge: | Recent studies have shown that models can benefit from query-aware methods for few-shot text classification. |
| Approach: | They propose a dynamic memory-based network for few-short text classification that uses static memory to adapt to unseen classes. |
| Outcome: | The proposed model improves on the miniRCV1 and ODIC datasets by 24% . Detailed analysis is performed to show how the proposed network achieves the new performance. |
History Semantic Graph Enhanced Conversational KBQA with Temporal Information Modeling (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for conversational KBQA assume the independence of utterances and model them in isolation. |
| Approach: | They propose a History Semantic Graph Enhanced KBQA model that models long-range semantic dependencies in conversation history while maintaining low computational cost. |
| Outcome: | The proposed model outperforms baselines on a widely used question type dataset. |
Towards Generalizable and Robust Text-to-SQL Parsing (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Text-to-SQL parsers must be generalizable and robust against input perturbations. |
| Approach: | They propose a novel framework to learn text-to-SQL parsing in stages to improve parser's ability to acquire general SQL knowledge instead of capturing spurious patterns. |
| Outcome: | The proposed framework achieves state-of-the-art performance on the Spider, SParC, and CoSQL datasets. |
Graph-to-Text Generation with Dynamic Structure Pruning (2022.coling-1)
Copied to clipboard
| Challenge: | Recent studies show that explicitly modeling the input graph structure can significantly improve the performance. |
| Approach: | They propose a structure-aware cross-attention mechanism to re-encode the graph representation conditioning on the newly generated context at each decoding step. |
| Outcome: | The proposed model improves performance on two graph-to-text datasets with only minor increase on computational cost. |
CATS: A Pragmatic Chinese Answer-to-Sequence Dataset with Large Scale and High Quality (2023.acl-long)
Copied to clipboard
Liang Li, Ruiying Geng, Chengyang Fang, Bing Li, Can Ma, Rongyu Cao, Binhua Li, Fei Huang, Yongbin Li
| Challenge: | Current datasets bias in the English language while leaving other languages underexplored. |
| Approach: | They propose a Chinese answer-to-sequence dataset with high quality and large scale . they propose encoding space for two hybrid knowledge resources to convert this task to a graph-totext problem. |
| Outcome: | The proposed method is effective in generating textual descriptions for the Chinese answer-to-sequence dataset. |
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. |