KG-FiD: Infusing Knowledge Graph in Fusion-in-Decoder for Open-Domain Question Answering (2022.acl-long)
Copied to clipboard
Donghan Yu, Chenguang Zhu, Yuwei Fang, Wenhao Yu, Shuohang Wang, Yichong Xu, Xiang Ren, Yiming Yang, Michael Zeng
| Challenge: | Open-Domain Question Answering (ODQA) models typically include a retrieving module and a reading module. |
| Approach: | They propose a new open-domain question-answering framework that uses a knowledge-enhanced version of FiD to improve the approach. |
| Outcome: | The proposed model improves on ODQA benchmark datasets with less than 40% computation cost. |
Similar Papers
REANO: Optimising Retrieval-Augmented Reader Models through Knowledge Graph Generation (2024.acl-long)
Copied to clipboard
| Challenge: | Existing knowledge graphs suffer from incompleteness and lack information critical for answering given questions. |
| Approach: | They propose to enhance the open domain question answering model with a knowledge graph generation module that generates KGs from the passages and an answer predictor. |
| Outcome: | The proposed model improves the exact match score by 2.7% on the EntityQuestion dataset, with an average improvement of 1.8% across all the datasets. |
Multi-Granularity Guided Fusion-in-Decoder (2024.findings-naacl)
Copied to clipboard
| Challenge: | Open-domain question answering requires deriving factual responses without explicit evidence . recent approaches combine retrieval of relevant information with response generation . |
| Approach: | They propose a model that concatenates multiple contexts in the decoding phase . they propose MGFiD, which harmonizes passage re-ranking with sentence classification . |
| Outcome: | The proposed model outperforms existing models on Natural Questions and TriviaQA datasets . it aggregates evident sentences into an anchor vector that instructs the decoder . |
Leveraging LLM-GNN Integration for Open-World Question Answering over Knowledge Graphs (2026.eacl-long)
Copied to clipboard
| Challenge: | Traditional KGQA assumes a closed world where answers must exist in the KG, limiting real-world applicability. |
| Approach: | They propose a system that combines a pre-trained GNN and an LLM for open-world QA. |
| Outcome: | The proposed system outperforms existing LLM–GNN systems on standard benchmarks and GLOW-BENCH, achieving up to 53.3% and an average 38% improvement. |
Question-guided Knowledge Graph Re-scoring and Injection for Knowledge Graph Question Answering (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Knowledge graph question answering (KGQA) aims to provide factual answers to natural language questions by leveraging structured information stored in a knowledge graph. |
| Approach: | They propose a Question-guided Knowledge Graph Re-scoring method to eliminate noisy pathways for the input question, thereby focusing specifically on pertinent factual knowledge. |
| Outcome: | The proposed method eliminates noisy pathways for the input question, thereby focusing specifically on pertinent factual knowledge. |
Optimizing Retrieval-augmented Reader Models via Token Elimination (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for ODQA use a retrieval-augmented language model . a generative model can cause a significant bottleneck in decoding time . |
| Approach: | They propose to eliminate some of the retrieved information that might not contribute essential information to the answer generation process. |
| Outcome: | The proposed method reduces run-time by up to 62.2% with only 2% reduction in performance and improves performance. |
FastFiD: Improve Inference Efficiency of Open Domain Question Answering via Sentence Selection (2024.acl-long)
Copied to clipboard
| Challenge: | Open Domain Question Answering (ODQA) is a longstanding task in Natural Language Processing that involves generating an answer solely based on a given question. |
| Approach: | They propose a novel approach that executes sentence selection on the encoded passages to enhance the inference speed while reducing the context length required for generating answers. |
| Outcome: | The proposed approach can increase inference speed by **2.3X-5.7X** while maintaining the model’s performance. |
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. |
Exploiting Abstract Meaning Representation for Open-Domain Question Answering (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing work attempts to address these challenges using Pretrained Language Models (PLMs) but the diversity of surface form expressions can hinder the model’s ability to capture accurate correlations, especially when the context is lengthy and complex. |
| Approach: | They propose a method known as Graph-as-Token (GST) to incorporate AMRs into PLMs to assist the model in understanding complex semantic information. |
| Outcome: | The proposed method outperforms existing methods and significantly improves performance on both Natural Questions and TriviaQA. |
Sequence-to-Sequence Knowledge Graph Completion and Question Answering (2022.acl-long)
Copied to clipboard
| Challenge: | Knowledge graph embedding (KGE) models represent each entity and relation of a knowledge graph (KG) with low-dimensional embeddable vectors. |
| Approach: | They propose to use an off-the-shelf encoder-decoder Transformer model to generate a knowledge graph embedding model that can be used for KG link prediction and incomplete KG question answering. |
| Outcome: | The proposed model outperforms baselines on multiple large-scale datasets without extensive hyperparameter tuning. |
Grape: Knowledge Graph Enhanced Passage Reader for Open-domain Question Answering (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Open-domain question answering (QA) models employ a retriever-reader pipeline . however, state-of-the-art readers fail to capture complex relationships between entities . |
| Approach: | They propose a knowledge graph enhanced passage reader that captures entities in questions and retrieved passages. |
| Outcome: | The proposed knowledge graph enhanced passage reader improves on open-domain QA benchmarks by up to 2.2 exact match scores. |