Hierarchical Re-ranker Retriever (HRR)

Ashish Singh, Priti Mohapatra
3/4/2025
cs.IRcs.CL

No confident code implementation found for this paper.

Abstract

Retrieving the right level of context for a given query is a perennial challenge in information retrieval - too large a chunk dilutes semantic specificity, while chunks that are too small lack broader context. This paper introduces the Hierarchical Re-ranker Retriever (HRR), a framework designed to achieve both fine-grained and high-level context retrieval for large language model (LLM) applications. In HRR, documents are split into sentence-level and intermediate-level (512 tokens) chunks to maximize vector-search quality for both short and broad queries. We then employ a reranker that operates on these 512-token chunks, ensuring an optimal balance neither too coarse nor too fine for robust relevance scoring. Finally, top-ranked intermediate chunks are mapped to parent chunks (2048 tokens) to provide an LLM with sufficiently large context.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{singh2025hierarchical,
  title  = {Hierarchical Re-ranker Retriever (HRR)},
  author = {Ashish Singh and Priti Mohapatra},
  year   = {2025},
  eprint = {2503.02401},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2503.02401v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2503.02401.svg)](https://codeofpaper.com/paper/2503.02401)

Discussion