AGRaME: Any-Granularity Ranking with Multi-Vector Embeddings
Revanth Gangi Reddy, Omar Attia, Yunyao Li, Heng Ji, Saloni Potdar
TL;DR
The paper tackles the need for flexible ranking at multiple granularity levels while keeping a single coarse encoding. It introduces AGRaME, a framework that leverages multi-vector embeddings to enable ranking from coarse passages down to finer subunits, guided by a multi-granular contrastive training objective. The approach yields notable gains in sentence-level ranking without sacrificing passage-level performance and extends to proposition-level attribution with a practical post-hoc citation method, PropCite, that improves retrieval-augmented generation. Overall, AGRaME enables more precise retrieval for open-domain QA and attribution tasks, with direct applications in post-hoc citation and evidence gathering for generated content.
Abstract
Ranking is a fundamental and popular problem in search. However, existing ranking algorithms usually restrict the granularity of ranking to full passages or require a specific dense index for each desired level of granularity. Such lack of flexibility in granularity negatively affects many applications that can benefit from more granular ranking, such as sentence-level ranking for open-domain question-answering, or proposition-level ranking for attribution. In this work, we introduce the idea of any-granularity ranking, which leverages multi-vector embeddings to rank at varying levels of granularity while maintaining encoding at a single (coarser) level of granularity. We propose a multi-granular contrastive loss for training multi-vector approaches, and validate its utility with both sentences and propositions as ranking units. Finally, we demonstrate the application of proposition-level ranking to post-hoc citation addition in retrieval-augmented generation, surpassing the performance of prompt-driven citation generation.
