Challenge: Existing retrieval methods for knowledge base question answering are either heuristic or interwoven with the reasoning, causing reasoning on the partial subgraphs.
Approach: They propose a subgraph retrieval framework that decouples the retrieval from the subsequent reasoning process and trains subgraphs for easier reasoning.
Outcome: The proposed framework improves retrieval and QA performance over existing methods.

Similar Papers

ReasoningLM: Enabling Structural Subgraph Reasoning in Pre-trained Language Models for Question Answering over Knowledge Graph (2023.emnlp-main)

Copied to clipboard

Challenge: Question Answering over Knowledge Graph (KGQA) aims to find answer entities for natural language questions based on knowledge graphs.
Approach: They propose a subgraph-aware self-attention mechanism to imitate the graph neural network (GNN) based module to perform multi-hop reasoning on KG.
Outcome: The proposed method surpasses state-of-the-art models by a large margin even with fewer updated parameters and less training data.
DSM: Question Generation over Knowledge Base via Modeling Diverse Subgraphs with Meta-learner (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods on knowledge base question generation learn a one-size-fits-all model by training together all subgraphs without distinguishing the diverse semantics of subgraph.
Approach: They propose a graph contrastive learning-based retriever to model diverse subgraphs with meta-learner to learn semantics-specific and semantics agnostic knowledge on and across these tasks.
Outcome: The proposed approach reduces learning difficulty and improves performance on two widely-adopted benchmarks on KBQG.
D-RAG: Differentiable Retrieval-Augmented Generation for Knowledge Graph Question Answering (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to Knowledge Graph Question Answering (KGQA) use Retrieval-Augmented Generation (RAG) but subgraph selection process is non-differentiable, preventing end-to-end training of the retriever and the generator.
Approach: They propose a Differentiable RAG approach that optimizes the retriever and the generator for KGQA.
Outcome: The proposed approach outperforms state-of-the-art approaches on WebQSP and CWQ.
Less is More: Making Smaller Language Models Competent Subgraph Retrievers for Multi-hop KGQA (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent studies suggest that Knowledge Graphs (KGs) contain valuable external knowledge for LLMs.
Approach: They propose to model a conditional subgraph retrieval task handled by small language models and use a subgraph identifier as a special token to retrieve subgraphs.
Outcome: The proposed model achieves competitive retrieval performance compared to state-of-the-art models relying on 7B parameters.
Query-Aware Graph Attention for Precise Subgraph Retrieval in Knowledge-Augmented Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing Knowledge Graph (KG)-based Retrieval-Augmented Generation (RAG) systems insufficiently model the interaction between query semantics and relation types, resulting in imprecise subgraph retrieval and unstable reasoning.
Approach: They propose a retrieval framework that integrates query semantics and relation embeddings directly into the attention mechanism.
Outcome: Experiments on WebQSP and CWQ establish new state-of-the-art results in both Triple Recall and Answer Recall.
Hypergraph Transformer: Weakly-Supervised Multi-hop Reasoning for Knowledge-based Visual Question Answering (2022.acl-long)

Copied to clipboard

Challenge: Existing knowledge-based visual question answering tasks require weak supervision and no visual knowledge.
Approach: They propose a model which encodes high-level semantics of a question and a knowledge base and learns high order associations between them.
Outcome: The proposed model encodes high-level semantics of a question and a knowledge base, and learns high order associations between them.
Retrieval-based Question Answering with Passage Expansion Using a Knowledge Graph (2024.lrec-main)

Copied to clipboard

Challenge: Recent advances in dense neural retrievers and language models have hindered performance, especially for less common entities and facts.
Approach: They propose a multi-modal passage retrieval model that combines entity features and textual data to improve retrieval precision for less common entities.
Outcome: The proposed model improves retrieval precision on less common entities and facts on common benchmarks.
Weakly Supervised Pre-Training for Multi-Hop Retriever (2021.findings-acl)

Copied to clipboard

Challenge: Existing methods for weakly supervised multi-hop pretraining require costly human annotation.
Approach: They propose a method for weakly supervised multi-hop retriever pretraining without human efforts by generating vector representations of complex questions and subquestion as weak supervision for pre-training.
Outcome: The proposed method is effective and robust on limited data and computational resources.
Graph-augmented Learning to Rank for Querying Large-scale Knowledge Graph (2022.aacl-main)

Copied to clipboard

Challenge: Existing knowledge graph question answering methods only search for the answer in a large knowledge graph.
Approach: They propose to partition retrieved knowledge subgraphs into smaller sub-KSGs and then use a graph-augmented learning to rank method to select the top-ranked sub-kSGs.
Outcome: The proposed method can capture global interactions in question and subgraphs and local interactions on the full KSG and top-ranked sub-KSGs respectively.
Subgraph-Guided Executable Logical Form Generation for Knowledge Base Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing retrieval-augmented approaches focus on ignoring the structural information of the Knowledge Base (KB) and the question.
Approach: They propose a structure-aware subgraph retrieval stage that ranks candidate subgraphs by aligning them with the question’s structure, along with semantic relevance.
Outcome: Experiments on GrailQA, WebQSP, and GraphQuestions show that the proposed framework achieves state-of-the-art performance.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations