GPR: Empowering Generation with Graph-Pretrained Retriever

• URL: http://arxiv.org/abs/2506.00261v2
• Date: Tue, 03 Jun 2025 02:07:40 GMT
• Title: GPR: Empowering Generation with Graph-Pretrained Retriever
• Abstract summary: GPR is a graph-based retriever pretrained directly on knowledge graphs.<n>It aligns natural language questions with relevant subgraphs through LLM-guided graph augmentation.<n>It employs a structure-aware objective to learn fine-grained retrieval strategies.
• Score: 45.643094894572464
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Graph retrieval-augmented generation (GRAG) places high demands on graph-specific retrievers. However, existing retrievers often rely on language models pretrained on plain text, limiting their effectiveness due to domain misalignment and structure ignorance. To address these challenges, we propose GPR, a graph-based retriever pretrained directly on knowledge graphs. GPR aligns natural language questions with relevant subgraphs through LLM-guided graph augmentation and employs a structure-aware objective to learn fine-grained retrieval strategies. Experiments on two datasets, three LLM backbones, and five baselines show that GPR consistently improves both retrieval quality and downstream generation, demonstrating its effectiveness as a robust retrieval solution for GRAG.

Related papers

• GLM-RAG: Graph Language Models for Graph-Based Retrieval-Augmented Generation [18.347573079509356]
  Retrieval-augmented generation (RAG) over knowledge graphs requires retrievers that can effectively capture both graph structure and semantic information.<n>Recent approaches have explored graph neural network (GNN)-based retrievers to model graph topology in multi-hop reasoning tasks.<n>In this work, we introduce a GLM-based retriever and investigate the comparative strengths of GLM-based, GNN-based, and traditional vector-search-based retrievers in single- and multi-hop RAG settings.
  arXiv  Detail & Related papers  (2026-07-30T15:49:34Z)
• STAR: Semantic-Tuned and Tail-Adaptive Retriever for Graph-Augmented Generation [69.66045538889777]
  We propose STAR, a semantic-tuned and tail-adaptive retriever for GraphRAG.<n> STAR consistently outperforms baselines, achieving average retrieval performance gains of 1.8%.
  arXiv  Detail & Related papers  (2026-04-11T10:16:51Z)
• Retrieving Minimal and Sufficient Reasoning Subgraphs with Graph Foundation Models for Path-aware GraphRAG [27.22974957852695]
  Graph-based retrieval-augmented generation (GraphRAG) exploits structured knowledge to support knowledge-intensive reasoning.<n>We propose GFM-Retriever that directly responds to user queries with a subgraph, where a pre-trained Graph Foundation Model acts as a cross-domain Retriever.<n>GFM-Retriever achieves state-of-the-art performance in both retrieval quality and answer generation, while maintaining efficiency.
  arXiv  Detail & Related papers  (2026-03-07T12:39:21Z)
• GRIL: Knowledge Graph Retrieval-Integrated Learning with Large Language Models [59.72897499248909]
  We propose a novel graph retriever trained end-to-end with Large Language Models (LLMs)<n>Within the extracted subgraph, structural knowledge and semantic features are encoded via soft tokens and the verbalized graph, respectively, which are infused into the LLM together.<n>Our approach consistently achieves state-of-the-art performance, validating the strength of joint graph-LLM optimization for complex reasoning tasks.
  arXiv  Detail & Related papers  (2025-09-20T02:38:00Z)
• GraphRunner: A Multi-Stage Framework for Efficient and Accurate Graph-Based Retrieval [3.792463570467098]
  GraphRunner is a novel graph-based retrieval framework that operates in three distinct stages: planning, verification, and execution.<n>It significantly reduces reasoning errors and detects hallucinations before execution.<n>Our evaluation using the GRBench dataset shows that GraphRunner consistently outperforms existing approaches.
  arXiv  Detail & Related papers  (2025-07-11T18:10:01Z)
• Weak-to-Strong GraphRAG: Aligning Weak Retrievers with Large Language Models for Graph-based Retrieval Augmented Generation [29.492846663357565]
  Graph-based retrieval-augmented generation (RAG) enables large language models (LLMs) to mitigate hallucinations.<n>This paper introduces Refined Graph-based RAG (ReG) to align weak retrievers to LLMs for graph-based RAG.<n>ReG incorporates LLM feedback to get rid of spurious signals and improve the quality of the supervision.
  arXiv  Detail & Related papers  (2025-06-26T17:40:23Z)
• Learning Efficient and Generalizable Graph Retriever for Knowledge-Graph Question Answering [75.12322966980003]
  Large Language Models (LLMs) have shown strong inductive reasoning ability across various domains.<n>Most existing RAG pipelines rely on unstructured text, limiting interpretability and structured reasoning.<n>Recent studies have explored integrating knowledge graphs with LLMs for knowledge graph question answering.<n>We propose RAPL, a novel framework for efficient and effective graph retrieval in KGQA.
  arXiv  Detail & Related papers  (2025-06-11T12:03:52Z)
• Align-GRAG: Reasoning-Guided Dual Alignment for Graph Retrieval-Augmented Generation [75.9865035064794]
  Large language models (LLMs) have demonstrated remarkable capabilities, but still struggle with issues like hallucinations and outdated information.<n>Retrieval-augmented generation (RAG) addresses these issues by grounding LLM outputs in external knowledge with an Information Retrieval (IR) system.<n>We propose Align-GRAG, a novel reasoning-guided dual alignment framework in post-retrieval phrase.
  arXiv  Detail & Related papers  (2025-05-22T05:15:27Z)
• GraphRAFT: Retrieval Augmented Fine-Tuning for Knowledge Graphs on Graph Databases [0.0]
  GraphRAFT is a retrieve-and-reason framework that finetunes LLMs to generate provably correct Cypher queries.<n>Our method is the first such solution that can be taken off-the-shelf and used on Knowledge Graphs stored in native graph DBs.
  arXiv  Detail & Related papers  (2025-04-07T20:16:22Z)
• GFM-RAG: Graph Foundation Model for Retrieval Augmented Generation [84.41557981816077]
  We introduce GFM-RAG, a novel graph foundation model (GFM) for retrieval augmented generation.<n>GFM-RAG is powered by an innovative graph neural network that reasons over graph structure to capture complex query-knowledge relationships.<n>It achieves state-of-the-art performance while maintaining efficiency and alignment with neural scaling laws.
  arXiv  Detail & Related papers  (2025-02-03T07:04:29Z)
• Evaluating and Improving Graph to Text Generation with Large Language Models [46.529034150391595]
  Large language models (LLMs) have demonstrated immense potential across various tasks.<n>We conduct a comprehensive evaluation of prompting current open-source LLMs on graph-to-text generation tasks.<n>We introduce a new graph-to-text dataset, PlanGTG, annotated with two sub-tasks: reordering and attribution.
  arXiv  Detail & Related papers  (2025-01-24T13:53:54Z)
• GRAG: Graph Retrieval-Augmented Generation [14.98084919101233]
  Graph Retrieval-Augmented Generation (GRAG) tackles the fundamental challenges in retrieving textual subgraphs. We propose a novel divide-and-conquer strategy that retrieves the optimal subgraph structure in linear time. Our approach significantly outperforms current state-of-the-art RAG methods.
  arXiv  Detail & Related papers  (2024-05-26T10:11:40Z)
• G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering [61.93058781222079]
  We develop a flexible question-answering framework targeting real-world textual graphs. We introduce the first retrieval-augmented generation (RAG) approach for general textual graphs. G-Retriever performs RAG over a graph by formulating this task as a Prize-Collecting Steiner Tree optimization problem.
  arXiv  Detail & Related papers  (2024-02-12T13:13:04Z)
• SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning [131.04781590452308]
  We present SimTeG, a frustratingly Simple approach for Textual Graph learning. We first perform supervised parameter-efficient fine-tuning (PEFT) on a pre-trained LM on the downstream task. We then generate node embeddings using the last hidden states of finetuned LM.
  arXiv  Detail & Related papers  (2023-08-03T07:00:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.