# MIXRAG : Mixture-of-Experts Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering

Source: [MIXRAG : Mixture-of-Experts Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering](<https://www.sota2.com/research/paper/68fa7b911e209131cea892a9>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-02-11T05:00:04.178Z

Authors: Lihui Liu, Jiayuan Ding, Subhabrata Mukherjee, Carl J. Yang

Published: 2025-09-24T02:44:57.000Z

## Abstract

Large Language Models (LLMs) have achieved impressive performance across a wide range of applications. However, they often suffer from hallucinations in knowledge-intensive domains due to their reliance on static pretraining corpora. To address this limitation, Retrieval-Augmented Generation (RAG) enhances LLMs by incorporating external knowledge sources during inference. Among these sources, textual graphs provide structured and semantically rich information that supports more precise and interpretable reasoning. This has led to growing interest in graph-based RAG systems. Despite their potential, most existing approaches rely on a single retriever to identify relevant subgraphs, which limits their ability to capture the diverse aspects of complex queries. Moreover, these systems often struggle to accurately judge the relevance of retrieved content, making them prone to distraction by irrelevant noise. To address these challenges, in this paper, we propose MIXRAG, a Mixture-of-Experts Graph-RAG framework that introduces multiple specialized graph retrievers and a dynamic routing controller to better handle diverse query intents. Each retriever is trained to focus on a specific aspect of graph semantics, such as entities, relations, or subgraph topology. A Mixture-of-Experts module adaptively selects and fuses relevant retrievers based on the input query. To reduce noise in the retrieved information, we introduce a query-aware GraphEncoder that carefully analyzes relationships within the retrieved subgraphs, highlighting the most relevant parts while down-weighting unnecessary noise. Empirical results demonstrate that our method achieves state-of-the-art performance and consistently outperforms various baselines. MIXRAG is effective across a wide range of graph-based tasks in different domains. The code will be released upon paper acceptance.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Retrieval-Augmented Generation on Novel](<https://www.sota2.com/research/sota/retrieval-augmented-generation-on-novel.md>): Retrieval-Augmented Generation; Novel; Indexing Time (mins): 17.

- [Retrieval-Augmented Generation on Medical (Cost Evaluation)](<https://www.sota2.com/research/sota/retrieval-augmented-generation-on-medical-cost-evaluation.md>): Retrieval-Augmented Generation; medical; Indexing Time (minutes): 11.

- [Retrieval-Augmented Generation on IFS-REL](<https://www.sota2.com/research/sota/retrieval-augmented-generation-on-ifs-rel.md>): Retrieval-Augmented Generation; IFS-REL; Indexing Time (mins): 2.

- [Retrieval-Augmented Generation on WOS](<https://www.sota2.com/research/sota/retrieval-augmented-generation-on-wos.md>): Retrieval-Augmented Generation; WOS; Indexing Time (mins): 5.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2509.21391>)

[PDF](<https://arxiv.org/pdf/2509.21391.pdf>)
