When not to trust language models: Investigating effectiveness of parametric and non-parametric memories

A Mallen, A Asai, V Zhong, R Das, D Khashabi… - arXiv preprint arXiv …, 2022 - arxiv.org
Despite their impressive performance on diverse tasks, large language models (LMs) still
struggle with tasks requiring rich world knowledge, implying the limitations of relying solely …

Evaluating open-domain question answering in the era of large language models

E Kamalloo, N Dziri, CLA Clarke, D Rafiei - arXiv preprint arXiv …, 2023 - arxiv.org
Lexical matching remains the de facto evaluation method for open-domain question
answering (QA). Unfortunately, lexical matching fails completely when a plausible candidate …

Learning to filter context for retrieval-augmented generation

Z Wang, J Araki, Z Jiang, MR Parvez… - arXiv preprint arXiv …, 2023 - arxiv.org
On-the-fly retrieval of relevant knowledge has proven an essential element of reliable
systems for tasks such as open-domain question answering and fact verification. However …

Fid-light: Efficient and effective retrieval-augmented text generation

S Hofstätter, J Chen, K Raman, H Zamani - Proceedings of the 46th …, 2023 - dl.acm.org
Retrieval-augmented generation models offer many benefits over standalone language
models: besides a textual answer to a given query they provide provenance items retrieved …

Merging generated and retrieved knowledge for open-domain QA

Y Zhang, M Khalifa, L Logeswaran, M Lee… - arXiv preprint arXiv …, 2023 - arxiv.org
Open-domain question answering (QA) systems are often built with retrieval modules.
However, retrieving passages from a given source is known to suffer from insufficient …

Towards robust qa evaluation via open llms

E Kamalloo, S Upadhyay, J Lin - … of the 47th International ACM SIGIR …, 2024 - dl.acm.org
Instruction-tuned large language models (LLMs) have been shown to be viable surrogates
for the widely used, albeit overly rigid, lexical matching metrics in evaluating question …

CREPE: Open-Domain Question Answering with False Presuppositions

XV Yu, S Min, L Zettlemoyer, H Hajishirzi - arXiv preprint arXiv:2211.17257, 2022 - arxiv.org
Information seeking users often pose questions with false presuppositions, especially when
asking about unfamiliar topics. Most existing question answering (QA) datasets, in contrast …

Detrimental contexts in open-domain question answering

P Oh, J Thorne - arXiv preprint arXiv:2310.18077, 2023 - arxiv.org
For knowledge intensive NLP tasks, it has been widely accepted that accessing more
information is a contributing factor to improvements in the model's end-to-end performance …

Beyond relevant documents: A knowledge-intensive approach for query-focused summarization using large language models

W Zhang, JH Huang, S Vakulenko, Y Xu… - … Conference on Pattern …, 2025 - Springer
Query-focused summarization (QFS) is a fundamental task in natural language processing
with broad applications, including search engines and report generation. However …

Rfid: Towards rational fusion-in-decoder for open-domain question answering

C Wang, H Yu, Y Zhang - arXiv preprint arXiv:2305.17041, 2023 - arxiv.org
Open-Domain Question Answering (ODQA) systems necessitate a reader model capable of
generating answers by simultaneously referring to multiple passages. Although …