Cited by 24Information Retrieval and Search BehaviorTopic ModelingNatural Language Processing Techniques

Adaptive Information Seeking for Open-Domain Question Answering

Open access
Zhu, Yunchang, Pang, Liang, Lan, Yanyan, Shen, Huawei, Cheng, Xueqi·2021·Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing

Abstract

Information seeking is an essential step for open-domain question answering to efficiently gather evidence from a large corpus.Recently, iterative approaches have been proven to be effective for complex questions, by recursively retrieving new evidence at each step.However, almost all existing iterative approaches use predefined strategies, either applying the same retrieval function multiple times or fixing the order of different retrieval functions, which cannot fulfill the diverse requirements of various questions.In this paper, we propose a novel adaptive information-seeking strategy for open-domain question answering, namely AISO.Specifically, the whole retrieval and answer process is modeled as a partially observed Markov decision process, where three types of retrieval operations (e.g., BM25, DPR, and hyperlink) and one answer operation are defined as actions.According to the learned policy, AISO could adaptively select a proper retrieval action to seek the missing evidence at each step, based on the collected evidence and the reformulated query, or directly output the answer when the evidence set is sufficient for the question.Experiments on SQuAD Open and HotpotQA fullwiki, which serve as single-hop and multi-hop open-domain QA benchmarks, show that AISO outperforms all baseline methods with predefined strategies in terms of both retrieval and answer evaluations.

Integrity signals

Registry

Crossref · 10.18653/v1/2021.emnlp-main.293

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Prior graph-augmented retrieval work trains a re-ranking module that can traverse a graph made using Wikipedia hyperlinks.

    “In this second category, previous work trains a re-ranking module which can traverse a graph made using Wikipedia hyperlinks [16, 100, 54, 14, 4, 44].”

The citation lists haven’t been fetched yet

References 40 · Cited by 24

Authors
Zhu, Y., Pang, L., Lan, Y., Shen, H., & Cheng, X.
Affiliations
  • Chinese Academy of Sciences (CN)
  • University of Chinese Academy of Sciences (CN)
Venue
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
Published
2021
Pages
3615-3626
OpenAlex
W3198963570
Cited by
24
References
40
Citations by year
2025: 1 · 2024: 3 · 2023: 8 · 2022: 12
FWCI
4.77
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • Conference on Empirical Methods in Natural Language Processing (EMNLP) (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University) (cc-by)
Funders
National Natural Science Foundation of China (91746301, 61773362, 61906180)
Topics
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
Keywords
open-domain question answering, iterative retrieval, partially observable Markov decision processes, BM25, DPR, multi-hop question answering, HotpotQA

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review