| Challenge: | generative retrieval models encode pointers to information in a corpus as an index within the model’s parameters. |
| Approach: | They propose a generative retrieval model that leverages contextual information to rerank retrieved page titles and utilizes REINFORCE to maximize rewards generated by constrained decoding. |
| Outcome: | The proposed model can't be tuned for the downstream readers as decoding the page title is a non-differentiable operation. |
Similar Papers
Re2G: Retrieve, Rerank, Generate (2022.naacl-main)
Copied to clipboard
Michael Glass, Gaetano Rossiello, Md Faisal Mahbub Chowdhury, Ankita Naik, Pengshan Cai, Alfio Gliozzo
| Challenge: | Recent models such as RAG and REALM incorporate retrieval into conditional generation. |
| Approach: | They propose a method that combines retrieval and reranking into a BART-based sequence-to-sequence generation. |
| Outcome: | The proposed model combines retrieval and reranking into a BART-based sequence-to-sequence generation. |
Enhancing Generative Retrieval with Reinforcement Learning from Relevance Feedback (2023.emnlp-main)
Copied to clipboard
| Challenge: | End-to-end generative retrieval models produce document identifiers in response to a query . however, this approach has two challenges: an overemphasis on top-1 results at the expense of overall ranking quality. |
| Approach: | They propose a generative retrieval model with reinforcement learning from relevance feedback to align token-level docid generation with document-level relevance estimation. |
| Outcome: | The proposed model aligns token-level docid generation with document-level relevance estimation. |
GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs (2026.findings-acl)
Copied to clipboard
Meixiu Long, Duolin Sun, Dan Yang, Yihan Jiao, Lei Liu, Jiahai Wang, Binbin Hu, Yue Shen, Jie Feng, Zhehao Tan, Junjie Wang, Lianzhen Zhong, Jian Wang, Peng Wei, Jinjie Gu
| Challenge: | Existing rankers excel in lexical-matching scenarios, while they struggle with complex queries requiring deep reasoning. |
| Approach: | They propose a new paradigm that balances flexibility and context awareness to unlock the full potential of groupwise reranking. |
| Outcome: | The proposed approach achieves a state-of-the-art 65.2 NDCG@10 on BRIGHT and surpasses baselines by 2.1 points on R2MED while delivering a 6.4 inference speedup. |
Optimizing RAG Rerankers with LLM Feedback via Reinforcement Learning (2026.acl-long)
Copied to clipboard
| Challenge: | Current reranking models are optimized on static human annotations in isolation, decoupled from the downstream generation process. |
| Approach: | They propose a reinforcement learning framework that directly aligns reranking with LLM's generation quality. |
| Outcome: | Experiments on knowledge-intensive benchmarks show that RRPO outperforms strong baselines. |
ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent Large Language Models (LLMs) have demonstrated remarkable performance in document reranking tasks. |
| Approach: | They propose a two-stage training approach for document reranking using reinforcement learning and fine-grained score learning. |
| Outcome: | The proposed approach outperforms open-source and proprietary reranking models on BEIR benchmark. |
Breaking Boundaries in Retrieval Systems: Unsupervised Domain Adaptation with Denoise-Finetuning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing domain adaptation methods for dense retrieval models use unadapted rerank models, leading to imprecise labels. |
| Approach: | They propose to adapt a rerank model to the target domain before using it for label generation. |
| Outcome: | The proposed model achieves better results across three retrieval datasets. |
Reinforced IR: A Self-Boosting Framework For Domain-Adapted Information Retrieval (2025.acl-long)
Copied to clipboard
| Challenge: | Existing retrieval methods struggle with highly specialized situations that require extensive domain expertise. |
| Approach: | They propose a method that integrates additional information from an LLM-based generator to enhance query performance and train the retriever to better discriminate the relevant documents identified by the generator. |
| Outcome: | The proposed method outperforms existing domain adaptation methods by a large margin and leads to substantial improvements in retrieval quality across a wide range of application scenarios. |
DiffusionRet: Diffusion-Enhanced Generative Retriever using Constrained Decoding (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Generative retrieval methods have suffered from the lack of the intermediate reasoning step . generative retrieval uses sequence-to-sequence diffusion models to map a query to relevant docids . |
| Approach: | They propose a novel method that uses query as an intermediate step before retrieval . they propose to use sequence-to-sequence diffusion models to map a query to relevant docids . |
| Outcome: | Experiments show that proposed method outperforms existing methods on MARCO and Natural Questions datasets. |
Leveraging Structured Metadata for Improving Question Answering on the Web (2020.aacl-main)
Copied to clipboard
| Challenge: | Using metadata information from web pages can improve the performance of answer passage selection/reranking models. |
| Approach: | They propose a neural passage selection model that leverages metadata information with a fine-grained encoding strategy to learn the representation for metadata predicates in a hierarchical way. |
| Outcome: | The proposed model outperforms baseline models on the MS MARCO and Recipe-MARCO datasets and shows that it is more accurate than baseline models. |
HYRR: Hybrid Infused Reranking for Passage Retrieval (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing passage retrieval systems typically adopt a two-stage retrieve-then-rerank pipeline. |
| Approach: | They propose a framework for training robust reranking models using hybrid retrievers . they propose HYRR framework that allows users to select training data using hybrids . |
| Outcome: | The proposed framework is robust to different first-stage retrieval settings. |