Papers by Le Qi
From Local to Global: Revisiting Structured Pruning Paradigms for Large Language Models (2026.acl-long)
Copied to clipboard
Ziyan Wang, Enmao Diao, Qi Le, Pu Wang, Minwoo Lee, Shu-ping Yeh, Evgeny Stupachenko, Hao Feng, Li Yang
| Challenge: | Structured pruning is a practical approach to deploying large language models (LLMs) but it fails to capitalize on modest task-specific calibration signals, causing limited downstream gains. |
| Approach: | They propose a method that removes attention heads and MLP channels using loss-based important scores . they use perplexity for language modeling and a margin-based objective for decision-style tasks . |
| Outcome: | The proposed method lowers perplexity and improves accuracy at higher sparsity . it also stabilizes accuracy and mitigates perxity collapse without fine-tuning . |
DuReadervis: A Chinese Dataset for Open-domain Document Visual Question Answering (2022.findings-acl)
Copied to clipboard
| Challenge: | Open-domain question answering is a task that requires answering questions based on a collection of document images. |
| Approach: | They propose to use document images to answer questions using layouts and visual features instead of text. |
| Outcome: | The proposed approach reduces human cost and improves scalability of QA systems by incorporating layouts and visual features. |
Improving Robustness of Language Models from a Geometry-aware Perspective (2022.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have found that removing the norm-bounded projection and increasing search steps in adversarial training can significantly improve robustness. |
| Approach: | They propose friendly adversarial data augmentation and geometry-aware adversarial training to achieve stronger robustness using fewer search steps. |
| Outcome: | The proposed method can obtain stronger robustness using fewer steps than existing methods. |
JointLK: Joint Reasoning with Language Models and Knowledge Graphs for Commonsense Question Answering (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing KG-augmented models for commonsense question answering ignore the effectively fusing and reasoning over question context representations and the KG representations. |
| Approach: | They propose a novel model which combines a logical reasoning and a dynamic pruning mechanism to solve these limitations. |
| Outcome: | The proposed model improves existing models and performs interpretable reasoning on the CommonsenseQA and OpenBookQA datasets. |
Outcome Accuracy is Not Enough: Aligning the Reasoning Process of Reward Models (2026.acl-long)
Copied to clipboard
Binghai Wang, Yantao Liu, Yuxuan Liu, Tianyi Tang, Shenzhi Wang, Chang Gao, Chujie Zheng, Yichang Zhang, Le Yu, Shixuan Liu, Tao Gui, Qi Zhang, Xuanjing Huang, Bowen Yu, Fei Huang, Junyang Lin
| Challenge: | Recent studies observe a phenomenon where reward models achieve high accuracy on static datasets but fail to generalize effectively during RLHF. |
| Approach: | They propose a method that combines rationale consistency with outcome accuracy to improve performance on RM-Bench and JudgeBench. |
| Outcome: | The proposed method surpasses baselines on RM-Bench and JudgeBench by an average of 5% and improves creative writing tasks by 7%. |
All Information is Valuable: Question Matching over Full Information Transmission Network (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for question matching only transmit one kind of information while failing to utilize both kinds of information simultaneously. |
| Approach: | They propose a question matching network that can transmit both representation and interactive information together in a simultaneous fashion. |
| Outcome: | The proposed approach outperforms strong baseline models on two standard benchmarks. |
TSGP: Two-Stage Generative Prompting for Unsupervised Commonsense Question Answering (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing studies focus on acquiring relevant knowledge by retrieving external knowledge bases and fine-tuning pre-trained models. |
| Approach: | They propose a two-stage prompt-based unsupervised commonsense question answering framework that leverages implicit knowledge stored in PrLMs to generate knowledge for questions with unlimited types and possible candidate answers independent of specified choices. |
| Outcome: | The proposed framework significantly improves the reasoning ability of language models in unsupervised settings. |
Question Directed Graph Attention Network for Numerical Reasoning over Text (2020.emnlp-main)
Copied to clipboard
Kunlong Chen, Weidi Xu, Xingyi Cheng, Zou Xiaochuan, Yuyu Zhang, Le Song, Taifeng Wang, Yuan Qi, Wei Chu
| Challenge: | Numerical reasoning requires both natural language understanding and arithmetic computation. |
| Approach: | They propose a graph representation for the context of the passage and question needed for numerical reasoning. |
| Outcome: | The proposed model achieves remarkable results in benchmark datasets such as DROP. |
AID: Adaptive Integration of Detectors for Safe AI with Language Models (2025.naacl-long)
Copied to clipboard
| Challenge: | Large language models (LLMs) are increasingly used to generate human-like text, but safety concerns have emerged with the deployment of LLMs. |
| Approach: | They propose an approach that orchestrates the strengths of multiple pretrained detectors to ensure comprehensive effectiveness in diverse scenarios. |
| Outcome: | The proposed approach can improve the area under the curve (AUC) by 0.07 to 0.21, with a median of 0.12, compared to the best individual detectors developed for specific safety aspects. |