Grape: Knowledge Graph Enhanced Passage Reader for Open-domain Question Answering
원문 초록
A common thread of open-domain question answering (QA) models employs a retriever-reader pipeline that first retrieves a handful of relevant passages from Wikipedia and then peruses the passages to produce an answer. However, even state-of-the-art readers fail to capture the complex relationships between entities appearing in questions and retrieved passages, leading to answers that contradict the facts. In light of this, we propose a novel knowledge Graph enhanced passage reader, namely Grape, to improve the reader performance for open-domain QA. Specifically, for each pair of question and retrieved passage, we first construct a localized bipartite graph, attributed to entity embeddings extracted from the intermediate layer of the reader model. Then, a graph neural network learns relational knowledge while fusing graph and contextual representations into the hidden states of the reader model. Experiments on three open-domain QA benchmarks show Grape can improve the state-of-the-art performance by up to 2.2 exact match score with a negligible overhead increase, with the same retriever and retrieved passages. Our code is publicly available at https://github.com/jumxglhf/GRAPE.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TableRAG: A Retrieval Augmented Generation Framework for Heterogeneous Document Reasoning
ECoRAG: Evidentiality-guided Compression for Long Context RAG
Efficient Context Selection for Long-Context QA: No Tuning, No Iteration, Just Adaptive-$k$
iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question Answering
Answer Complex Questions: Path Ranker Is All You Need
MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph
토론
이 논문과 연결된 포럼 글이 아직 없습니다.