Papers with re-ranker
Improving Language Generation from Feature-Rich Tree-Structured Data with Relational Graph Convolutional Encoders (D19-63)
Copied to clipboard
| Challenge: | The goal of the multilingual surface realization shared task is to generate fluent text from UD structures. |
| Approach: | They propose to use a graph convolutional network to encode the dependency trees given as input. |
| Outcome: | The proposed system achieves the third rank without data augmentation techniques or additional components. |
UR2N: Unified Retriever and ReraNker (2025.coling-industry)
Copied to clipboard
| Challenge: | XTR-style retrieval on top of trained Mono-T5 reranker is suboptimal for two-stage retrieval, arguing that it is sub-optimal. |
| Approach: | They propose a unified encoder-decoder architecture with a novel training regimen which enables the encoder representation to be used for retrieval and the decoder for re-ranking within a single unified model. |
| Outcome: | The proposed architecture outperforms ColBERT, XTR, and even serves as a superior reranker compared to the Mono-T5 re-ranker. |
Generating EDU Extracts for Plan-Guided Summary Re-Ranking (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods to generate summary candidates for re-ranking produce redundant, and often low quality, content. |
| Approach: | They propose a method to generate candidates for re-ranking that addresses these issues by grounding each abstract on its own unique content plan and creating distinct plan-guided abstracts using a model's top beam. |
| Outcome: | The proposed method outperforms baseline decoding methods on CNN, NYT, and Xsum and shows that prompting GPT-3 to follow EDU plans outperformed sampling-based methods by 1.05 points. |
RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies show that passage retrieval and passage reranking are important for achieving mutual improvement. |
| Approach: | They propose a unified listwise training approach for passage retrieval and passage reranking that incorporates a retrieval procedure and a hybrid data augmentation strategy. |
| Outcome: | The proposed approach improves on both MSMARCO and Natural Questions datasets. |
Improving Passage Retrieval with Zero-Shot Question Generation (2022.emnlp-main)
Copied to clipboard
Devendra Sachan, Mike Lewis, Mandar Joshi, Armen Aghajanyan, Wen-tau Yih, Joelle Pineau, Luke Zettlemoyer
| Challenge: | Existing re-ranking methods for open-domain question answering are not domain- or task-specific. |
| Approach: | They propose a simple and effective re-ranking method for improving passage retrieval in open-domain question answering. |
| Outcome: | The proposed method outperforms strong supervised models on open-domain questions and triviaQA datasets on top-1000 passages. |
External Knowledge Acquisition for End-to-End Document-Oriented Dialog Systems (2023.eacl-main)
Copied to clipboard
| Challenge: | End-to-end neural models for conversational AI often assume that a response can be generated by considering only the knowledge acquired during training. |
| Approach: | They propose an architecture for document-oriented conversations with access to external knowledge sources. |
| Outcome: | The proposed architecture outperforms baseline models on the Wizard of Wikipedia dataset by 10.3% and 7.4%. |
Optimizing Test-Time Query Representations for Dense Retrieval (2023.findings-acl)
Copied to clipboard
| Challenge: | Recent developments of dense retrieval rely on quality representations of queries and contexts from pre-trained query and context encoders. |
| Approach: | They propose a test-time optimization of query representations that provides fine-grained pseudo labels over retrieval results. |
| Outcome: | The proposed algorithm improves open-domain question answering accuracy and direct re-ranking by up to 2.0% while running 1.3–2.4x faster with an efficient implementation. |
Belief Revision Based Caption Re-ranker with Visual Semantic Information (2022.coling-1)
Copied to clipboard
| Challenge: | Xu et al., 2015; You e t al, 2016) aimed at generating a natural language description for a given image. |
| Approach: | They propose a visual re-ranking approach that leverages visual-semantic measures to identify the ideal caption that maximally captures the visual information in the image. |
| Outcome: | The proposed approach improves the performance of image caption generation systems without training or fine-tuning. |
Efficient and Accurate Contextual Re-Ranking for Knowledge Graph Question Answering (2024.lrec-main)
Copied to clipboard
Kexuan Sun, Nicolaas Paul Jedema, Karishma Sharma, Ruben Janssen, Jay Pujara, Pedro Szekely, Alessandro Moschitti
| Challenge: | Existing approaches to QA over textual data are based on a "retrieve-then-generate" pipeline. |
| Approach: | They propose a "triple-level" labeling strategy that infers fine-grained labels and trains a re-ranker to improve relevance of retrieved triples. |
| Outcome: | The proposed pipeline improves on prior KGQA systems by 5.56% Exact Match. |
Query-Focused Retrieval Heads Improve Long-Context Reasoning and Re-ranking (2025.emnlp-main)
Copied to clipboard
| Challenge: | Recent work has identified retrieval heads as a subset of attention heads responsible for retrieving salient information in long-context language models. |
| Approach: | They introduce a retrieval head that uses attention scores to enhance retrieval from long context . they use QRRetriever to select the most relevant parts with the highest retrieval scores . |
| Outcome: | The proposed retrieval heads outperform other retrieval-based retrieval retrievers on BEIR benchmarks. |