REVIEW 3 cited by
Knowledge Guided Text Retrieval and Reading for Open Domain Question Answering
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce an approach for open-domain question answering (QA) that retrieves and reads a passage graph, where vertices are passages of text and edges represent relationships that are derived from an external knowledge base or co-occurrence in the same article. Our goals are to boost coverage by using knowledge-guided retrieval to find more relevant passages than text-matching methods, and to improve accuracy by allowing for better knowledge-guided fusion of information across related passages. Our graph retrieval method expands a set of seed keyword-retrieved passages by traversing the graph structure of the knowledge base. Our reader extends a BERT-based architecture and updates passage representations by propagating information from related passages and their relations, instead of reading each passage in isolation. Experiments on three open-domain QA datasets, WebQuestions, Natural Questions and TriviaQA, show improved performance over non-graph baselines by 2-11% absolute. Our approach also matches or exceeds the state-of-the-art in every case, without using an expensive end-to-end training regime.
Forward citations
Cited by 3 Pith papers
-
KAMR: Grounding Generation via Knowledge-Aligned Multi-hop Retrieval
Partial-alignment contrastive pretraining plus anchor-then-expand graph retrieval improves multi-hop KG evidence recovery and downstream QA over strong dense and graph RAG baselines.
-
KET-RAG: A Cost-Efficient Multi-Granular Indexing Framework for Graph-RAG
KET-RAG uses a PageRank-selected knowledge graph skeleton plus a text-keyword bipartite graph to lower Graph-RAG indexing cost while achieving comparable or better retrieval and generation quality.
-
GPR: Empowering Generation with Graph-Pretrained Retriever
GPR pretrains a two-tower retriever on knowledge graphs using LLM-generated questions from masked triplets and a soft-preference triplet loss, improving KGQA accuracy across datasets and LLMs.
Discussion (0). Continue with ORCID to comment.