Skip to content

R$^{2}$Adapter: A Routing and Rewriting Adapter for Efficient Hybrid RAG

Jul 2026 · 0 citations · 35 references
Computer Science

TL;DR

R$^{2}$Adapter is a lightweight plug-in Routing and Rewriting Adapter designed to allocate queries between vanilla and graph-based RAG dynamically, providing an efficient and adaptive solution for hybrid RAG systems.

Abstract

Retrieval-Augmented Generation (RAG) has become a prevailing paradigm for enhancing Large Language Models (LLMs) with non-parametric knowledge. Vanilla RAG efficiently handles simple queries but struggles with relational or multi-hop reasoning. Graph-based RAG alleviates this issue but incurs higher inference complexity and latency. In practice, user queries can differ significantly in their complexity, rendering a fixed RAG strategy suboptimal. However, existing hybrid text-graph RAG methods typically rely on heuristic and LLM-based routing, resulting in unnecessary overhead and strong dependence on the underlying LLM. To address these challenges, we propose R$^{2}$Adapter, a lightweight plug-in Routing and Rewriting Adapter designed to allocate queries between vanilla and graph-based RAG dynamically. By routing only the queries that genuinely benefit from graph-based reasoning, R$^{2}$Adapter reduces unnecessary graph retrieval overhead. Additionally, uncertain graph-routed queries are rewritten to better expose their multi-hop reasoning requirements, improving retrieval quality without additional supervision. Extensive experiments on three multi-hop QA benchmarks demonstrate that R$^{2}$Adapter reduces graph-based RAG usage by up to 59% while maintaining comparable answer accuracy. This adapter is model-agnostic and can be seamlessly integrated into diverse vanilla and graph-based RAG pipelines, providing an efficient and adaptive solution for hybrid RAG systems.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

One Size Does Not Fit All! Dynamic Retriever and Generator Selection for RAG

This work systematically analyze how retriever and generator complexity interacts across factoid and multi-hop question answering (QA), including bridge and composition reasoning tasks, and introduces DRAG, a query-adaptive framework for selecting retriever-generator configurations.

Neeraj Anand, Payel Santra, Partha Basuchowdhuri et al. · 0 citations
Preprint Sep 2026

Asymmetric Dynamic Routing: Balancing Reasoning Depth and Computational Efficiency in Hypergraph RAG

Asymmetric Dynamic Routing is proposed, an intent-conditioned retrieval framework operating over hierarchical knowledge graphs that maintains strong reasoning performance while reducing prompt token consumption and end-to-end query latency, yielding a favorable quality--efficiency trade-off for query-adaptive Hypergrap...

Qi Sun, Yi-Jia Zhang, Cai-Bo Li et al. · 0 citations
#artificial intelligence Preprint Sep 2026

LiteRAG: Cost-Efficient Graph-Based Retrieval-Augmented Generation

LiteRAG is presented, a graph-based retrieval method that replaces expensive retrieval-time LLM control with query-conditioned algorithmic exploration and reasoning-chain context construction and attains the highest overall quality among the evaluated methods.

Daniel Alejandro Coll Tejeda, Pedro García López, Daniel Barcelona-Pons · 0 citations
Preprint Aug 2026

Noesis: Bidirectional Graph-RAG with Adaptive Parallelism and Cross-Knowledge-Base Semantic Discovery

Noesis, a decoupled Graph-RAG architecture addressing limitations through four algorithms: Bidirectional Graph Traversal with a Graph-Feedback Context Resolver simulating human reading with degrading memory, an AIMD Concurrency Controller adapted from TCP congestion control, and Moesis, domain-aware selective quantizat...

Nicola Cogotti · 1 citation
#artificial intelligence Preprint Sep 2026

MOSAIC: Query-Aware Exploration Policy Adaptation for GraphRAG

Mosaic is presented, a training-free framework that formulates GraphRAG retrieval as a per-query control problem that converts query-specific evidence requirements into a bounded policy over seed selection, graph traversal, stopping, and evidence selection while the corpus graph, indexes, scoring functions, grounding p...

Eunkyeong Lee, Kyeong-Jin Oh, Jinwon Kim et al. · 0 citations
Open access Sep 2026

PoP-RAG: Holistic Query Planning for GraphRAG

PoP-RAG is proposed, which features a passage-on-edge (PoE) graph that links the passages with graph edges to resolve the one-to-many entity-passage mapping problem and enables targeted retrieval for each sub-query and ensures transparent response derivation logic, thus enhancing explainability.

Xin-Tong Hu, Qi-Ming Zeng, Yu-Hao Lin et al. · 1 citation

Related blog posts

MIT News · Artificial Intelligence Nov 17, 2026

Learning the language of machine learning

By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.