Graph-Based Re-ranking: Emerging Techniques, Limitations, and Opportunities
By: Md Shahir Zaoad , Niamat Zawad , Priyanka Ranade and more
Potential Business Impact:
Helps computers understand information better for smarter answers.
Knowledge graphs have emerged to be promising datastore candidates for context augmentation during Retrieval Augmented Generation (RAG). As a result, techniques in graph representation learning have been simultaneously explored alongside principal neural information retrieval approaches, such as two-phased retrieval, also known as re-ranking. While Graph Neural Networks (GNNs) have been proposed to demonstrate proficiency in graph learning for re-ranking, there are ongoing limitations in modeling and evaluating input graph structures for training and evaluation for passage and document ranking tasks. In this survey, we review emerging GNN-based ranking model architectures along with their corresponding graph representation construction methodologies. We conclude by providing recommendations on future research based on community-wide challenges and opportunities.
Similar Papers
Graph-based Approaches and Functionalities in Retrieval-Augmented Generation: A Comprehensive Survey
Information Retrieval
Helps computers answer questions using real-world facts.
When to use Graphs in RAG: A Comprehensive Analysis for Graph Retrieval-Augmented Generation
Computation and Language
Helps AI understand complex ideas better.
A Survey of Graph Retrieval-Augmented Generation for Customized Large Language Models
Computation and Language
Helps computers understand complex topics better.