Aug 2026· arXiv.org· Vol abs/2608.30525· 0 citations· 23 references
Computer Science
TL;DR
LoG-Reranker is proposed, a local-to-global sentence-level graph reranking framework for scientific synthesis that consistently outperforms competitive rerankers, yielding more reliable rankings and improving the quality of generated synthesis.
Abstract
Retrieval-augmented scientific synthesis aims to answer complex research questions by integrating information from multiple papers into comprehensive and well-grounded responses. Since the generator can only synthesize the information selected and organized by the reranker, the quality of the generated synthesis depends critically on the reranked results. However, most rerankers operate at the passage level, which leaves key methodological, empirical, and comparative information buried in long and flat contexts, weakening the grounding of generated claims. Moreover, existing rerankers mainly rely on independent query-candidate scoring which overlooks complementary, contextual, and contrasting relations across scientific candidates, limiting information coverage and the comprehensiveness of the resulting synthesis. To address these limitations, we propose LoG-Reranker, a local-to-global sentence-level graph reranking framework for scientific synthesis. LoG-Reranker performs role-aware local scoring to identify fine-grained, query-relevant sentences and then models their relations on a sentence graph across the candidate set to globally refine sentence rankings. Top-ranked sentences and their connected neighbors are organized into a structured input context for generator to produce more grounded and comprehensive synthesis. Extensive experiments on scientific synthesis and reranking benchmarks show that LoG-Reranker consistently outperforms competitive rerankers, yielding more reliable rankings and improving the quality of generated synthesis.
This paper proposes a retrieve-and-rerank baseline consisting of the Harrier-27b dense retriever and the Jina cross-encoder reranker, and explores several extensions to improve the baseline, including multilingual query normalization through translation and noise removal, dense retriever and reranker fine-tuning, and l...
Farnoush Zeidi, Farnaz Zeidi, Roman Christof et al.· 1 citation
Most automated survey generation systems retrieve papers as flat documents, limiting their ability to capture research structure. We present SurveyGraph, a framework built around a Methods-Entity Knowledge Graph (MEKG) encoding method-level follow-on, competition, and shared-resource relations. The graph supports core-...
Yi-Fan Yuan, Yan-Cheng Zhu, Zuo-Yu Zhang et al.· Conference on Empirical Meth...· 0 citations
Textual graph question answering (GraphQA) and graph-based retrieval-augmented generation (GraphRAG) have gained increasing attention as a way to ground large language models (LLMs) on structured knowledge. Despite extensive efforts, existing methods still face two key gaps. The first is an architectural gap: existing...
Kai-Feng Jin, Yu-Chen Yan, Zhichen Zeng et al.· 0 citations
A deep understanding of scientific literature often relies on interpreting figures that contain key information beyond the main text. Leveraging Large Language Models (LLMs) to extract insights from these figures can significantly accelerate knowledge discovery. Existing works on Scientific Visual Question Answering re...
Sheikh Tahmim Mehdi, Muminul Islam Jami· 0 citations
Retrieval-Augmented Generation (RAG) is now the standard way to ground Large Language Models (LLMs) in external knowledge, yet the design space of retrieval pipelines is large and the trade-offs between variants are not well understood, especially on domain-specific corpora at realistic scale. In this work, we present...
B. Rathi, Eshan Chawla, William B. Andreopoulos· 0 citations
Passage reranking plays a crucial role in information retrieval by refining the ordering of candidate passages to better reflect relevance. Existing listwise LLM rerankers with Chain-of-Thought (CoT) reasoning can handle complex queries effectively, but they suffer from substantial redundancy and high latency due to sl...
Yang Zhang, Wen-Han Liu, Qian-Nan Zhu et al.· Proceedings of the 2026 Conf...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.