Papers by Hui Luo
SecFormer: Fast and Accurate Privacy-Preserving Inference for Transformer Models via SMPC (2024.findings-acl)
Copied to clipboard
| Challenge: | a growing number of cloud-based inference services are relying on SMPC to protect data privacy. |
| Approach: | They propose a framework for Privacy-Preserving Inference for Transformer models that eliminates exponential and maximum operations in PPI without sacrificing model performance. |
| Outcome: | The proposed framework outperforms MPCFormer in terms of performance and efficiency . it is 3.57 and 3.58 times faster than PUMA for BERTBASE and BERTLARGE . |
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. |
Experience is the Teacher: Reusing Atomic Thoughts from LLMs to Improve Medical Dialogue (2026.findings-acl)
Copied to clipboard
Guangya Yu, Hui Luo, Qi Ye, Ruihui Hou, Weiyan Zhang, Mingxi Shang, Xuanwu Li, ChunMing Wang, Tong Ruan
| Challenge: | Recent large reasoning models (LLMs) lack dynamic and diverse thinking capabilities . reusing atomic thoughts provides a practical pathway toward dynamic reasoning . |
| Approach: | They propose a framework that extracts atomic thoughts from teacher models and reuses them to guide reasoning and generate responses. |
| Outcome: | The proposed framework extracts atomic thoughts from teacher models and reuses them to guide reasoning and generate responses. |
Stepwise Perplexity-Guided Refinement for Efficient Chain-of-Thought Reasoning in Large Language Models (2025.findings-acl)
Copied to clipboard
Yingqian Cui, Pengfei He, Jingying Zeng, Hui Liu, Xianfeng Tang, Zhenwei Dai, Yan Han, Chen Luo, Jing Huang, Zhen Li, Suhang Wang, Yue Xing, Jiliang Tang, Qi He
| Challenge: | Chain-of-Thought (CoT) reasoning has improved the performance of large language models (LLMs) however, the detailed reasoning process in CoT often incurs long generation times and high computational costs due to the inclusion of unnecessary steps. |
| Approach: | They propose a method to identify critical reasoning steps using perplexity as a measure of their importance. |
| Outcome: | The proposed method achieves a better balance between reasoning accuracy and efficiency of CoT. |
Facilitating Long Context Understanding via Supervised Chain-of-Thought Reasoning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in Large Language Models (LLMs) have enabled them to process increasingly longer sequences, ranging from 2K to 2M tokens and even beyond. |
| Approach: | They propose a synthetic dataset in the financial domain that integrates Chain-of-Thought reasoning into LLMs in a supervised manner to facilitate effective long-context understanding. |
| Outcome: | The proposed model outperforms standard GPT-4o-mini on the Loong benchmark and fine tunes LLaMA-3.1-8B-Instruct on the model, achieving a 28.0% gain on the financial subset. |
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. |
SimRAG: Self-Improving Retrieval-Augmented Generation for Adapting Large Language Models to Specialized Domains (2025.naacl-long)
Copied to clipboard
Ran Xu, Hui Liu, Sreyashi Nag, Zhenwei Dai, Yaochen Xie, Xianfeng Tang, Chen Luo, Yang Li, Joyce C. Ho, Carl Yang, Qi He
| Challenge: | Retrieval-augmented generation (RAG) enhances the question answering abilities of large language models (LLMs) however, adapting general-purpose RAG systems to specialized fields poses unique challenges due to distribution shifts and limited access to domain-specific data. |
| Approach: | They propose a method that equips large language models with joint capabilities of question answering and question generation for domain adaptation. |
| Outcome: | Experiments on 11 datasets across three different domains verify the efficacy of SimRAG over baselines by 1.2%–8.6%. |
CENTAUR: Bridging the Impossible Trinity of Privacy, Efficiency, and Performance in Privacy-Preserving Transformer Inference (2025.acl-long)
Copied to clipboard
Jinglong Luo, Guanzhong Chen, Yehong Zhang, Shiyu Liu, Hui Wang, Yue Yu, Xun Zhou, Yuan Qi, Zenglin Xu
| Challenge: | Existing privacy-preserving Transformer Inference frameworks suffer from high computational overhead and performance losses. |
| Approach: | They propose a framework that integrates random permutations and SMPC to address the "impossible trinity" CENTAUR resists diverse data reconstruction attacks and boosts inference speed by 5.030.4 times . |
| Outcome: | CENTAUR achieves an unprecedented balance between privacy, efficiency, and performance. |
EcomScriptBench: A Multi-task Benchmark for E-commerce Script Planning via Step-wise Intention-Driven Product Association (2025.acl-long)
Copied to clipboard
Weiqi Wang, Limeng Cui, Xin Liu, Sreyashi Nag, Wenju Xu, Chen Luo, Sheikh Muhammad Sarwar, Yang Li, Hansu Gu, Hui Liu, Changlong Yu, Jiaxin Bai, Yifan Gao, Haiyang Zhang, Qi He, Shuiwang Ji, Yangqiu Song
| Challenge: | Goal-oriented script planning is used by humans to plan for typical activities . however, this capability remains underexplored due to several challenges . |
| Approach: | They propose a framework that enables product-enriched scripts by associating products with each step based on the semantic similarity between the actions and their purchase intentions. |
| Outcome: | The proposed framework can generate product-enriched scripts from 2.4 million scripts . human annotations are conducted to provide gold labels for a sampled subset . |
Efficient Knowledge Infusion via KG-LLM Alignment (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for knowledge infusion face knowledge mismatch and poor information compliance of LLMs with knowledge graphs. |
| Approach: | They propose a three-stage alignment strategy to enhance the LLM's capability to utilize information from knowledge graphs. |
| Outcome: | The proposed method outperforms baselines on biomedical question-answering datasets and outperformed existing methods. |
HSCodeComp: A Realistic and Expert-level Agent Benchmark for Hierarchical Rule Application (2026.acl-long)
Copied to clipboard
| Challenge: | Existing agent benchmarks neglect hierarchical rule application in real-world domains . a critical gap persists in numerous real-life professional domains where decision-making is governed by expert-written rules. |
| Approach: | They propose a benchmark requiring agents to assign a unique 10-digit Harmonized System (HS) Code to products by aligning their fuzzy attributes with strict tariff classification rules. |
| Outcome: | The proposed benchmarks lack hierarchical rule application capability in real-world domains . the proposed benchmark is based on e-commerce and is open-source . |
SPACE-2: Tree-Structured Semi-Supervised Contrastive Pre-training for Task-Oriented Dialog Understanding (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for dialog understanding only consider self-augmented dialogs as positive samples and treat all other dialogs like negative ones. |
| Approach: | They propose a tree-structured pre-trained conversation model which learns dialog representations from limited labeled dialogs and large-scale unlabeled dialog corpora via semi-supervised contrastive pre-training. |
| Outcome: | The proposed model can achieve state-of-the-art results on the DialoGLUE benchmark. |
HCRE: LLM-based Hierarchical Classification for Cross-Document Relation Extraction with a Prediction-then-Verification Strategy (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to cross-document relation extraction (RE) focus on identifying relations between head and tail entities from single sentence or document. |
| Approach: | They propose a hierarchical relation tree-based LLM-based hierarchic classification model for cross-document relation extraction (HCRE) based on predefined relations, the model can perform hierarchically classification level by level. |
| Outcome: | The proposed model outperforms existing baselines and validates its effectiveness. |
Enrich, Aggregate, and Generate: Three-stage Biomedical Data-to-Text Generation Using Large Language Models in Low-resource Scenarios (2026.findings-acl)
Copied to clipboard
| Challenge: | Biomedical data-to-text generation is a branch of Natural Language Generation, aiming at generating textual natural language descriptions that can fluently and precisely describe the structured data. |
| Approach: | They propose an LLM framework that can be used to generate textual natural language descriptions using in-context learning. |
| Outcome: | The proposed framework provides good interpretability and superior performance on the BioLeaflets dataset. |
Anchoring the Cache: Mitigating Contextual Hallucination in KV-Compressed Long-Context Summarization (2026.acl-long)
Copied to clipboard
| Challenge: | Recent studies show that KV cache compression can increase hallucination scores in LLMs . modern LLM models support extremely long sequences, but their impact on model hallucinosity remains underexplored. |
| Approach: | They propose a decoding-phase strategy that selectively removes generated KV pairs from retrieval heads responsible for retrieving critical information from source context. |
| Outcome: | The proposed method reduces hallucination across multiple models and datasets while preserving computational efficiency. |
CBLUE: A Chinese Biomedical Language Understanding Evaluation Benchmark (2022.acl-long)
Copied to clipboard
Ningyu Zhang, Mosha Chen, Zhen Bi, Xiaozhuan Liang, Lei Li, Xin Shang, Kangping Yin, Chuanqi Tan, Jian Xu, Fei Huang, Luo Si, Yuan Ni, Guotong Xie, Zhifang Sui, Baobao Chang, Hui Zong, Zheng Yuan, Linfeng Li, Jun Yan, Hongying Zan, Kunli Zhang, Buzhou Tang, Qingcai Chen
| Challenge: | a new benchmark for biomedical language understanding is being developed in Chinese . most benchmarks are limited to English, which makes it difficult to replicate success in other languages. |
| Approach: | They propose to use Chinese biomedical language understanding evaluation benchmarks to evaluate Chinese models. |
| Outcome: | The proposed benchmarks show that the current models perform worse than the human ceiling. |
Reasoning with Graphs: Structuring Implicit Knowledge to Enhance LLMs Reasoning (2025.findings-acl)
Copied to clipboard
Haoyu Han, Yaochen Xie, Hui Liu, Xianfeng Tang, Sreyashi Nag, William Headden, Yang Li, Chen Luo, Shuiwang Ji, Qi He, Jiliang Tang
| Challenge: | Large language models (LLMs) have demonstrated remarkable success across a wide range of tasks, however, they still face challenges in reasoning tasks that require understanding and inferring relationships between distinct pieces of information within text sequences. |
| Approach: | They propose to construct explicit graphs from context and leverage them to enhance LLM reasoning performance on reasoning tasks. |
| Outcome: | Extensive experiments show that the proposed method improves both logical reasoning and multi-hop question answering tasks. |
Graph-Assisted Large Language Models: A Perspective on Mitigating Intrinsic Limitations (2026.findings-acl)
Copied to clipboard
Haitong Luo, Fali Wang, Weiyao Zhang, Xianren Zhang, Zhiwei Zhang, Tianxiang Zhao, Minhua Lin, Jiahao Zhang, Hui Liu, Xianfeng Tang, Qi He, Suhang Wang, Xuying Meng, Yujun Zhang
| Challenge: | Large language models exhibit intrinsic limitations such as knowledge cutoff, single-threaded reasoning that hinders finer-grained branch and aggregation, and rigid collaboration mechanisms that struggle to coordinate specialized capabilities. |
| Approach: | They propose a taxonomy spanning *Graph-Assisted Knowledge Augmentation*, *Graph Assisted Reasoning and Planning*, and *Graphed LLM Collaboration*. |
| Outcome: | The proposed models show that graphs can augment and correct LLMs and support dynamic coordination among experts and agents in collaborative settings. |
LogToP: Logic Tree-of-Program with Table Instruction-tuned LLMs for Controlled Logical Table-to-Text Generation (2026.findings-eacl)
Copied to clipboard
Yupian Lin, Guangya Yu, Cheng Yuan, Huan Du, Hui Luo, Yuang Bian, Jingping Liu, Zhidong He, Wen Du, Tong Ruan
| Challenge: | Existing LLMs are difficult to achieve satisfactory results in table-related tasks. |
| Approach: | They propose to develop a specialized logical table-to-text generation model that can be used for table-related tasks. |
| Outcome: | The proposed model achieves state-of-the-art on a Logic2Text dataset. |