Papers by Shulin Cao
FC-KBQA: A Fine-to-Coarse Composition Framework for Knowledge Base Question Answering (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for question answering over knowledge bases (KBQA) suffer from generalization issues due to coarse-grained modeling of the logical expression. |
| Approach: | They propose a fine-to- coarse-grained framework for KBQA to ensure generalization and executability of the logical expression. |
| Outcome: | The proposed framework derives new state-of-the-art performance on GrailQA and WebQSP, and runs 4 times faster than baseline. |
LongCite: Enabling LLMs to Generate Fine-grained Citations in Long-Context QA (2025.findings-acl)
Copied to clipboard
Jiajie Zhang, Yushi Bai, Xin Lv, Wanjun Gu, Danqing Liu, Minhao Zou, Shulin Cao, Lei Hou, Yuxiao Dong, Ling Feng, Juanzi Li
| Challenge: | Current long-context large language models lack citations to support their responses, making verification difficult due to potential hallucinations. |
| Approach: | They propose to use off-the-shelf LLMs to automatically construct long-context QA instances with precise sentence-level citations and leverage this pipeline to construct a large-scale SFT dataset for LQAC. |
| Outcome: | The proposed pipeline can generate responses with fine-grained citations on the fly, surpassing existing models including GPT-4o. |
Knowledge-augmented Self-training of A Question Rewriter for Conversational Knowledge Base Question Answering (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Recent rise of conversational applications has promoted the development of conversation KBQA (ConvKBQA). |
| Approach: | They propose a framework to produce a full-fledged rewritten question based on conversation history and then reason the answer by existing single-turn KBQA models. |
| Outcome: | The proposed framework produces a full-fledged rewritten question based on the conversation history and reasoned the answer by existing single-turn KBQA models. |
Program Transfer for Answering Complex Questions over Knowledge Bases (2022.acl-long)
Copied to clipboard
| Challenge: | Program induction for complex questions over knowledge bases relies on a large number of parallel question-program pairs for the given KB, but the gold program annotations are usually lacking, making learning difficult. |
| Approach: | They propose an approach to leverage program annotations on rich KBs as external supervision signals to aid program induction for low-resourced KB. |
| Outcome: | The proposed approach outperforms SOTA methods on ComplexWebQuestions and WebQuestionSP. |
KB-Plugin: A Plug-and-play Framework for Large Language Models to Induce Programs over Low-resourced Knowledge Bases (2024.emnlp-main)
Copied to clipboard
| Challenge: | Program induction (PI) is a promising paradigm for using knowledge bases (KBs) to help large language models answer complex knowledge-intensive questions. |
| Approach: | They propose a plug-and-play framework that enables large language models to induce programs over any low-resourced KB. |
| Outcome: | Experiments show that KB-Plugin outperforms SoTA low-resourced PI methods with 25x smaller backbone LLM on large-scale and domain-specific KBs and even approaches the performance of supervised methods. |
LongReward: Improving Long-context Large Language Models with AI Feedback (2025.acl-long)
Copied to clipboard
Jiajie Zhang, Zhongni Hou, Xin Lv, Shulin Cao, Zhenyu Hou, Yilin Niu, Lei Hou, Yuxiao Dong, Ling Feng, Juanzi Li
| Challenge: | In recent years, significant advancements have been achieved in the development of long-context large language models (LLMs). |
| Approach: | They propose a method that utilizes an off-the-shelf LLM to provide rewards for long-context model responses from four human-valued dimensions: helpfulness, logicality, faithfulness, and completeness. |
| Outcome: | The proposed method improves models’ long-context performance and enhances their ability to follow short instructions. |
LongBench v2: Towards Deeper Understanding and Reasoning on Realistic Long-context Multitasks (2025.acl-long)
Copied to clipboard
Yushi Bai, Shangqing Tu, Jiajie Zhang, Hao Peng, Xiaozhi Wang, Xin Lv, Shulin Cao, Jiazheng Xu, Lei Hou, Yuxiao Dong, Jie Tang, Juanzi Li
| Challenge: | Existing benchmarks on longcontext large language models fail to reflect their deep understanding capabilities across diverse tasks. |
| Approach: | They propose a benchmark to assess the ability of long-context large language models to handle long-text problems. |
| Outcome: | The proposed model achieves 50.1% accuracy when directly answering the questions . human experts achieve only 53.7% accuracy under a 15-minute time constraint . |
KoRC: Knowledge Oriented Reading Comprehension Benchmark for Deep Text Understanding (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing benchmarks for deep text understanding have encountered two major limitations . most require human annotation of knowledge, which leads to limited knowledge coverage . |
| Approach: | They propose a benchmark to help readers understand a document with prior knowledge . they use massive knowledge bases to guide annotators and large language models to construct knowledgable questions . |
| Outcome: | The proposed benchmarks have limited knowledge coverage and use choices or spans as answers, which results in narrow answer space. |
Probabilistic Tree-of-thought Reasoning for Answering Knowledge-intensive Complex Questions (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) are capable of answering knowledge-intensive complex questions with chain-of-thought reasoning. |
| Approach: | They propose a method to solve complex questions with a tree-of-thought approach using parametric knowledge and retrieved external knowledge to augment CoT reasoning. |
| Outcome: | The proposed approach outperforms SOTA methods on three Complex QA datasets under the open-domain setting. |
SeaKR: Self-aware Knowledge Retrieval for Adaptive Retrieval Augmented Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Adaptive Retrieval-Augmented Generation (RAG) is an effective strategy to alleviate hallucination of large language models (LLMs). |
| Approach: | They propose a novel adaptive RAG model that extracts self-aware uncertainty of large language models from their internal states and invokes retrieval accordingly. |
| Outcome: | The proposed model outperforms existing adaptive RAG methods on complex and simple Question Answering datasets. |
Reasoning over Hierarchical Question Decomposition Tree for Explainable Question Answering (2023.acl-long)
Copied to clipboard
| Challenge: | Existing XQA methods focus on reasoning on a single knowledge source, e.g., structured knowledge bases, unstructured corpora, etc. Existing work in XQA focuses on integrating information from heterogeneous knowledge sources. |
| Approach: | They propose to leverage question decomposing for heterogeneous knowledge integration by breaking down a complex question into simpler ones and selecting the appropriate knowledge source for each sub-question. |
| Outcome: | The proposed framework outperforms SOTA methods on complex QA datasets. |
How Proficient Are Large Language Models in Formal Languages? An In-Depth Insight for Knowledge Base Question Answering (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have validated that large language models (LLMs) are capable of solving some KBQA problems, but there has been little discussion on the differences in LLMs’ proficiency in formal languages used in semantic parsing. |
| Approach: | They propose to evaluate the understanding and generation ability of large language models (LLMs) to deal with differently structured logical forms by examining the inter-conversion of natural and formal language through in-context learning of LLMs. |
| Outcome: | The proposed model can understand formal languages as well as humans, but generating correct logical forms remains a challenge. |
GraphQ IR: Unifying the Semantic Parsing of Graph Query Languages with One Intermediate Representation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to neural semantic parsing are limited by the semantic gap between natural and formal languages. |
| Approach: | They propose a unified intermediate representation for graph query languages, named GraphQ IR, which has a natural-language-like expression that bridges the semantic gap and formally defined syntax that maintains the graph structure. |
| Outcome: | The proposed representation can convert user queries into graphQ IR, which can later be losslessly compiled into various downstream graph query languages. |
Linguistic Rules-Based Corpus Generation for Native Chinese Grammatical Error Correction (2022.findings-emnlp)
Copied to clipboard
Shirong Ma, Yinghui Li, Rongyi Sun, Qingyu Zhou, Shulin Huang, Ding Zhang, Li Yangning, Ruiyang Liu, Zhongli Li, Yunbo Cao, Haitao Zheng, Ying Shen
| Challenge: | Chinese Grammatical Error Correction (CGEC) is a challenging NLP task and a common application in human daily life. |
| Approach: | They propose a linguistic rules-based approach to construct large-scale CGEC training corpora with automatically generated grammatical errors. |
| Outcome: | The proposed method improves performance of existing CGEC models and the benchmark is excellent resource for further development. |
Learning from the Dictionary: Heterogeneous Knowledge Guided Fine-tuning for Chinese Spell Checking (2022.findings-emnlp)
Copied to clipboard
Yinghui Li, Shirong Ma, Qingyu Zhou, Zhongli Li, Li Yangning, Shulin Huang, Ruiyang Liu, Chao Li, Yunbo Cao, Haitao Zheng
| Challenge: | Chinese Spell Checking (CSC) aims to detect and correct Chinese spelling errors. |
| Approach: | They propose a framework which renders Chinese Spell Checking model to learn heterogeneous knowledge from the dictionary in terms of phonetics, vision, and meaning. |
| Outcome: | The proposed framework renders the CSC model to learn heterogeneous knowledge from the dictionary in terms of phonetics, vision, and meaning. |
TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graph (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models infer the answer by predicting the sequential relation path or aggregating the hidden graph features. |
| Approach: | They propose a model which jumps between entities at multiple steps . they demonstrate that TransferNet surpasses state-of-the-art models by a large margin . |
| Outcome: | The proposed model surpasses state-of-the-art models on MetaQA and on other datasets. |
Dependency Parsing via Sequence Generation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing are transition-based, graph-based and sequence-to-sequence method. |
| Approach: | They propose to achieve dependency parsing (DP) via Sequence Generation (SG) by utilizing only the pre-trained language model without any auxiliary structures. |
| Outcome: | The proposed method performs well on DP benchmarks including PTB, UD2.2, SDP15 and SemEval16. |
VisKoP: Visual Knowledge oriented Programming for Interactive Knowledge Base Question Answering (2023.acl-demo)
Copied to clipboard
Zijun Yao, Yuanyong Chen, Xin Lv, Shulin Cao, Amy Xin, Jifan Yu, Hailong Jin, Jianjun Xu, Peng Zhang, Lei Hou, Juanzi Li
| Challenge: | Existing knowledge base question answering systems that parse natural language questions into knowledge oriented program language (KoPL) . |
| Approach: | They propose a knowledge base question answering system that integrates human into the loop to edit and debug queries. |
| Outcome: | The proposed system can debug and edit knowledge base questions on a million-entity-level . it provides auto-completion for its knowledge base schema and user interaction can fix a large portion of wrong KoPL programs to acquire the correct answer. |
KQA Pro: A Dataset with Explicit Compositional Programs for Complex Question Answering over Knowledge Base (2022.acl-long)
Copied to clipboard
Shulin Cao, Jiaxin Shi, Liangming Pan, Lunyiu Nie, Yutong Xiang, Lei Hou, Juanzi Li, Bin He, Hanwang Zhang
| Challenge: | Existing benchmarks for Complex KBQA lack compositional reasoning capabilities . Existing methods for Complex questions are poor in diversity or scale . |
| Approach: | They propose a compositional programming language to represent the reasoning process of complex questions. |
| Outcome: | The proposed dataset includes around 120K diverse natural language questions . it provides a compositional and interpretable programming language to represent the reasoning process of complex questions based on the proposed model . |
OpenKE: An Open Toolkit for Knowledge Embedding (D18-2)
Copied to clipboard
| Challenge: | Existing knowledge embedding tools are available for embeddable knowledge graphs. |
| Approach: | They propose a unified framework and various fundamental models to embed knowledge graphs into a continuous low-dimensional space. |
| Outcome: | The toolkit and pre-trained embeddings are available on http://openke.thunlp.org/. |
Untangle the KNOT: Interweaving Conflicting Knowledge and Reasoning Skills in Large Language Models (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing studies have explained to what extent LLMs extract conflicting knowledge from the provided text, but they neglect the necessity to reason with conflicting information. |
| Approach: | They construct a dataset for knowledge conflict resolution examination in the form of question answering that divides reasoning with conflicting knowledge into three levels. |
| Outcome: | The proposed dataset enables analysis of reasoning with conflicting knowledge in the form of question answering. |