BRMGR independently reranks retrieved and LLM-generated passages with zero-shot likelihood scores and combines them by greedy matching, giving small exact match gains on open-domain QA.
Beyond [CLS] through Ranking by Generation
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Generative models for Information Retrieval, where ranking of documents is viewed as the task of generating a query from a document's language model, were very successful in various IR tasks in the past. However, with the advent of modern deep neural networks, attention has shifted to discriminative ranking functions that model the semantic similarity of documents and queries instead. Recently, deep generative models such as GPT2 and BART have been shown to be excellent text generators, but their effectiveness as rankers have not been demonstrated yet. In this work, we revisit the generative framework for information retrieval and show that our generative approaches are as effective as state-of-the-art semantic similarity-based discriminative models for the answer selection task. Additionally, we demonstrate the effectiveness of unlikelihood losses for IR.
citation-role summary
citation-polarity summary
fields
cs.CL 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Improving Generated and Retrieved Knowledge Combination Through Zero-shot Generation
BRMGR independently reranks retrieved and LLM-generated passages with zero-shot likelihood scores and combines them by greedy matching, giving small exact match gains on open-domain QA.