Divide & Conquer for Entailment-aware Multi-hop Evidence Retrieval
Lexical and semantic matches are commonly used as relevance measurements for information retrieval. Together they estimate the semantic equivalence between the query and the candidates. However, semantic equivalence is not the only relevance signal that needs to be considered when retrieving evidences for multi-hop questions. In this work, we demonstrate that textual entailment relation is another important relevance dimension that should be considered. To retrieve evidences that are either semantically equivalent to or entailed by the question simultaneously, we divide the task of evidence retrieval for multi-hop question answering (QA) into two sub-tasks, i.e., semantic textual similarity and inference similarity retrieval. We propose two ensemble models, EAR and EARnest, which tackle each of the sub-tasks separately and then jointly re-rank sentences with the consideration of the diverse relevance signals. Experimental results on HotpotQA verify that our models not only significantly outperform all the single retrieval models it is based on, but is also more effective than two intuitive ensemble baseline models.
Code (0)
등록된 구현이 없습니다.
Tasks
Information RetrievalMulti-hop Question AnsweringNatural Language InferenceQuestion AnsweringRetrievalSemantic Textual SimilaritySimilar Papers 제목 키워드 기반
Indoor Panorama Planar 3D Reconstruction via Divide and Conquer
Indoor panorama typically consists of human-made structures parallel or perpendicular to gravity. We leverage this phenomenon to approximate the scene in a 360-degree image with (H)orizontal-planes and (V)ertical-planes.…
3D ReconstructionInstance SegmentationSemantic SegmentationTranslationDivide-and-conquer methods for big data analysis
In the context of big data analysis, the divide-and-conquer methodology refers to a multiple-step process: first splitting a data set into several smaller ones; then analyzing each set separately; finally combining resul…
WDN: A Wide and Deep Network to Divide-and-Conquer Image Super-resolution
Divide and conquer is an established algorithm design paradigm that has proven itself to solve a variety of problems efficiently. However, it is yet to be fully explored in solving problems with a neural network, particu…
Image Super-ResolutionSuper-ResolutionDivide and Conquer: Accelerating Diffusion-Based Large Language Models via Adaptive Parallel Decoding
Diffusion-based large language models (dLLMs) have shown promising performance across various reasoning tasks, establishing themselves as an alternative to autoregressive large language models (LLMs). Unlike autoregressi…
Robust and Explainable Divide-and-Conquer Learning for Intrusion Detection
Machine learning-based intrusion detection requires complex models to capture patterns in high-dimensional, noisy, and class-imbalanced raw network traffic, yet deploying such models remains impractical on resource-const…
Network Intrusion DetectionAdversarial Robustness