Challenge: Existing studies rely on deep graph neural networks (GNNs) to capture rich structural information, but they lack the structural information needed for QA.
Approach: They propose a framework which captures structural information from KBs and models long-distance node relations from two perspectives.
Outcome: The proposed framework models long-distance node relations from two perspectives . it is based on two widely used multi-hop KBQA datasets .

Similar Papers

Large-Scale Relation Learning for Question Answering over Knowledge Bases with Pre-trained Language Models (2021.emnlp-main)

Copied to clipboard

Challenge: Existing KBQA methods focus on the natural language but ignore textual information carried by the nodes and edges.
Approach: They propose to perform relation extraction, relation matching, and relation reasoning tasks to align the natural language expressions to the relations in the KB and reason over the missing connections.
Outcome: Experiments on WebQSP show that the proposed model outperforms baselines even when the KB is incomplete.
QA-GNN: Reasoning with Language Models and Knowledge Graphs for Question Answering (2021.naacl-main)

Copied to clipboard

Challenge: Existing question answering systems lack the ability to access relevant knowledge and reason over it.
Approach: They propose a model that uses KGs to identify relevant knowledge in QA contexts and perform joint reasoning over them.
Outcome: The proposed model improves on the CommonsenseQA and OpenBookQA datasets and performs interpretable and structured reasoning.
Knowledge Base Question Answering through Recursive Hypergraphs (2021.eacl-main)

Copied to clipboard

Challenge: Existing methods for Knowledge Base Question Answering (KBQA) do not explicitly incorporate the recursive relational group structure in the given knowledge base.
Approach: They propose a method to model KBs through recursive hypergraphs using hypergraph data.
Outcome: The proposed method is based on recursive hypergraphs and has been released on multiple benchmarks.
Capturing Global Structural Information in Long Document Question Answering with Compressive Graph Selector Network (2022.emnlp-main)

Copied to clipboard

Challenge: Existing methods to answer long document questions ignore the global structure of the long document, which is essential for long-range understanding.
Approach: They propose a Compressive Graph Selector Network to capture the global structure of the long document in a compressive and iterative manner.
Outcome: The proposed model outperforms existing methods on two datasets.
Relation-Aware Question Answering for Heterogeneous Knowledge Graphs (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing retrieval-based approaches to solve multihop Knowledge Base Question Answering (KBQA) fail to utilize information from head-tail entities and the semantic connection between relations to enhance the information capturing of relations in KGs.
Approach: They propose to use a dual relation graph to find the answer entity in a knowledge graph . they use primal entity graph reasoning, dual relation grafitment and interaction .
Outcome: The proposed approach achieves significant performance gain over the prior state-of-the-art on two public datasets, WebQSP and CWQ.
Simple Question Answering with Subgraph Ranking and Joint-Scoring (N19-1)

Copied to clipboard

Challenge: Knowledge graph based simple question answering is a major area of research in question answering.
Approach: They propose a framework to describe and analyze existing knowledge graph based simple question answering approaches.
Outcome: The proposed model achieves a state-of-the-art (85.44% accuracy) on the SimpleQuestions dataset.
Pay More Attention to Relation Exploration for Knowledge Base Question Answering (2023.findings-acl)

Copied to clipboard

Challenge: Existing approaches focus on entity representation and final answer reasoning, which results in limited supervision for this task.
Approach: They propose a framework that utilizes relations to enhance entity representation and introduce additional supervision.
Outcome: The proposed framework improves the F1 score on two benchmark datasets by 5.8% . it improves by 6.7% on WebQSP, better than state-of-the-art methods .
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.
HetGCoT: Heterogeneous Graph-Enhanced Chain-of-Thought LLM Reasoning for Academic Question Answering (2025.findings-emnlp)

Copied to clipboard

Challenge: graph neural networks capture structured graph information, but lack integration at the reasoning level.
Approach: They propose a framework that leverages graph structural information to reason interpretable academic QA results.
Outcome: The proposed framework outperforms sota baselines on OpenAlex and DBLP datasets.
Interactive-KBQA: Multi-Turn Interactions for Knowledge Base Question Answering with Large Language Models (2024.acl-long)

Copied to clipboard

Challenge: Knowledge base question answering (KBQA) is a challenging task, particularly in parsing intricate questions into executable logical forms.
Approach: They propose a framework to generate logical forms through direct interaction with knowledge bases (KBs) by annotating a dataset with step-wise reasoning processes.
Outcome: The proposed framework achieves competitive results on the WebQuestionsSP, ComplexWebQuestIONS, KQA Pro, and MetaQA datasets with a minimal number of examples (shots). Importantly, the proposed model supports manual intervention, allowing for the iterative refinement of LLM outputs.

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