Challenge: Existing multi-hop retrieval of open-domain text-to-SQL tasks is not applicable due to the tendency to retrieve tables similar to those already retrieved but irrelevant to the question.
Approach: They propose a multi-hop table retrieval with removal task to retrieve unretrieved tables from open-domain text-to-SQL databases.
Outcome: The proposed method improves performance 5.7% over the previous state-of-the-art methods on open-domain text-to-SQL datasets.

Similar Papers

Multi-Hop Paragraph Retrieval for Open-Domain Question Answering (P19-1)

Copied to clipboard

Challenge: Existing methods for textual question answering are capable of outperforming humans on certain tasks.
Approach: They propose a method for retrieving multiple supporting paragraphs from a large knowledge base.
Outcome: The proposed method achieves state-of-the-art over two well-known datasets, SQuAD-Open and HotpotQA, which serve as benchmarks for the proposed method.
Open Domain Question Answering over Tables via Dense Retrieval (2021.naacl-main)

Copied to clipboard

Challenge: Recent advances in open-domain QA focus on retrieving textual passages . a retriever designed to handle tabular context can improve retrieval quality .
Approach: They propose a tabular-based retrieval model that improves retrieval quality over a BERT-based retriever.
Outcome: The proposed retriever improves retrieval quality with mined hard negatives over a BERT-based retriever.
Multi-hop Evidence Retrieval for Cross-document Relation Extraction (2023.findings-acl)

Copied to clipboard

Challenge: Relation Extraction (RE) is a task that seeks to identify the relation of entities described according to some context.
Approach: They propose a multi-hop evidence retrieval method based on evidence path mining and ranking to support cross-document relation extraction.
Outcome: The proposed method acquires cross-document evidence and boosts performance in both closed and open environments.
Simple yet Effective Bridge Reasoning for Open-Domain Multi-Hop Question Answering (D19-58)

Copied to clipboard

Challenge: Existing work on open-domain multi-hop question answering relies on off-the-shelf information retrieval techniques to retrieve answer passages.
Approach: They propose a new subproblem for open-domain multi-hop question answering . they aim to recognize the anchor from a set of start passages with a reading comprehension model .
Outcome: The proposed method significantly improves the baseline method on the open-domain hotpotQA benchmark.
LI-RAGE: Late Interaction Retrieval Augmented Generation with Explicit Signals for Open-Domain Table Question Answering (2023.acl-short)

Copied to clipboard

Challenge: Recent open-domain TableQA pipelines use a combination of retriever and reader . a table can be very large and might contain heterogeneous information across rows/columns .
Approach: They propose to combine a retriever-reader pipeline with a binary relevance token to train the retriever and reader.
Outcome: The proposed approaches improve on two open-domain TableQA datasets.
Text-to-Table: A New Way of Information Extraction (2022.acl-long)

Copied to clipboard

Challenge: Existing methods for information extraction are not well understood . text-to-table is a problem that aims to extract information from text data .
Approach: They propose a new problem setting of information extraction, called text-to-table . they formalize text- to-table as a sequence-tosequence problem .
Outcome: The proposed method outperforms existing methods on text-to-table tasks.
Expand, Rerank, and Retrieve: Query Reranking for Open-Domain Question Answering (2023.findings-acl)

Copied to clipboard

Challenge: Empirically, EAR improves top-5/20 accuracy by 3-8 and 5-10 points . dense retrievers are limited by their inability to perform semantic matching for relevant passages that have low lexical overlap with the query.
Approach: They propose a query expansion and reranking approach for improving passage retrieval with the application to open-domain question answering.
Outcome: Empirically, EAR improves top-5/20 accuracy by 3-8 and 5-10 points when compared to a vanilla query expansion model and a dense retrieval model.
End-to-End Beam Retrieval for Multi-Hop Question Answering (2024.naacl-long)

Copied to clipboard

Challenge: Existing beam retrieval frameworks for multi-hop question answering were customized for two-hop questions and were poorly supervised.
Approach: They propose an end-to-end beam retrieval framework for multi-hop question answering . they combine an encoder and two classification heads to optimize the retrieval process .
Outcome: The proposed framework improves on MuSiQue-Ans and surpasses all previous retrievers on HotpotQA and achieves 99.9% precision on 2WikiMultiHopQA.
Mitigating Lost-in-Retrieval Problems in Retrieval Augmented Multi-Hop Question Answering (2025.acl-long)

Copied to clipboard

Challenge: Empirical results show that ChainRAG consistently outperforms baselines in both effectiveness and efficiency.
Approach: They propose a method which sequentially handles each sub-question by completing missing key entities and retrieving relevant sentences from a sentence graph for answer generation.
Outcome: The proposed method outperforms baselines on three multi-hop QA datasets.
Open-Domain Question Answering (2020.acl-tutorials)

Copied to clipboard

Challenge: tutorial provides a comprehensive overview of cutting-edge research in open-domain question answering (QA)
Approach: tutorial provides a comprehensive overview of cutting-edge research in open-domain question answering . focus will shift to cutting- edge models proposed for open- domain QA .
Outcome: The tutorial will cover cutting-edge research in open-domain question answering (QA) it will cover two-stage retriever-reader approaches, dense retriever and end-to-end training, and retriever free methods .

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations