ROGRAG: A Robustly Optimized GraphRAG Framework

Large language models (LLMs) commonly struggle with specialized or emerging topics which are rarely seen in the training corpus.Graph-based retrieval-augmented generation (GraphRAG) addresses this by structuring domain knowledge as a graph for dynamic retrieval.However, existing pipelines involve complex engineering workflows, making it difficult to isolate the impact of individual components.It is also challenging to evaluate the retrieval effectiveness due to the overlap between the pretraining and evaluation datasets.In this work, we introduce ROGRAG, a Robustly Optimized GraphRAG framework.Specifically, we propose a multi-stage retrieval mechanism that integrates dual-level with logic form retrieval methods to improve retrieval robustness without increasing computational cost.To further refine the system, we incorporate various result verification methods and adopt an incremental database construction approach.Through extensive ablation experiments, we rigorously assess the effectiveness of each component.Our implementation includes comparative experiments on SeedBench, where Qwen2.5-7B-Instructinitially underperformed.ROGRAG significantly improves the score from 60.0% to 75.0% and outperforms mainstream methods.Experiments on domainspecific datasets reveal that dual-level retrieval enhances fuzzy matching, while logic form retrieval improves structured reasoning, highlighting the importance of multi-stage retrieval.ROGRAG is released as an open-source resource 1 and supports installation with pip.

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.18653/v1/2025.acl-demo.58
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ROGRAG: A Robustly Optimized GraphRAG Framework

Nanqing Dong, Jie Ying, Zhefan Wang, Wanli Ouyang et al.
Graph Theory and Algorithms
article

ROGRAG: A Robustly Optimized GraphRAG Framework

Nanqing Dong, Jie Ying, Zhefan Wang, Wanli Ouyang, Huanjun Kong
article en

Abstract

Large language models (LLMs) commonly struggle with specialized or emerging topics which are rarely seen in the training corpus.Graph-based retrieval-augmented generation (GraphRAG) addresses this by structuring domain knowledge as a graph for dynamic retrieval.However, existing pipelines involve complex engineering workflows, making it difficult to isolate the impact of individual components.It is also challenging to evaluate the retrieval effectiveness due to the overlap between the pretraining and evaluation datasets.In this work, we introduce ROGRAG, a Robustly Optimized GraphRAG framework.Specifically, we propose a multi-stage retrieval mechanism that integrates dual-level with logic form retrieval methods to improve retrieval robustness without increasing computational cost.To further refine the system, we incorporate various result verification methods and adopt an incremental database construction approach.Through extensive ablation experiments, we rigorously assess the effectiveness of each component.Our implementation includes comparative experiments on SeedBench, where Qwen2.5-7B-Instructinitially underperformed.ROGRAG significantly improves the score from 60.0% to 75.0% and outperforms mainstream methods.Experiments on domainspecific datasets reveal that dual-level retrieval enhances fuzzy matching, while logic form retrieval improves structured reasoning, highlighting the importance of multi-stage retrieval.ROGRAG is released as an open-source resource 1 and supports installation with pip.

Openalex Percentile: Top 83%
Graph Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.