English
Related papers

Related papers: DEXTER: A Benchmark for open-domain Complex Questi…

200 papers

Lexical matching remains the de facto evaluation method for open-domain question answering (QA). Unfortunately, lexical matching fails completely when a plausible candidate answer does not appear in the list of gold answers, which is…

Computation and Language · Computer Science 2023-07-10 Ehsan Kamalloo , Nouha Dziri , Charles L. A. Clarke , Davood Rafiei

In knowledge-intensive tasks such as open-domain question answering (OpenQA), large language models (LLMs) often struggle to generate factual answers, relying solely on their internal (parametric) knowledge. To address this limitation,…

Computation and Language · Computer Science 2025-04-29 Jinming Nian , Zhiyuan Peng , Qifan Wang , Yi Fang

Large language models (LLMs) are incredible and versatile tools for text-based tasks that have enabled countless, previously unimaginable, applications. Retrieval models, in contrast, have not yet seen such capable general-purpose models…

Information Retrieval · Computer Science 2025-09-10 Julian Killingback , Hamed Zamani

Recent advances in open-domain QA have led to strong models based on dense retrieval, but only focused on retrieving textual passages. In this work, we tackle open-domain QA over tables for the first time, and show that retrieval can be…

Computation and Language · Computer Science 2021-06-10 Jonathan Herzig , Thomas Müller , Syrine Krichene , Julian Martin Eisenschlos

Open-ended question answering requires models to find appropriate evidence to form wellreasoned, comprehensive and helpful answers. In practical applications, models also need to engage in extended discussions on potential scenarios closely…

Computation and Language · Computer Science 2024-12-17 Mingxu Tao , Dongyan Zhao , Yansong Feng

Large language models (LLMs) demonstrate remarkable performance across various tasks, prompting researchers to develop diverse evaluation benchmarks. However, most benchmarks typically measure the ability of LLMs to respond to individual…

Computation and Language · Computer Science 2026-01-30 Yutao Hou , Yajing Luo , Zhiwen Ruan , Hongru Wang , Weifeng Ge , Yun Chen , Guanhua Chen

Large Language Model (LLM) has gained popularity and achieved remarkable results in open-domain tasks, but its performance in real industrial domain-specific scenarios is average due to its lack of specific domain knowledge. This issue has…

Computation and Language · Computer Science 2023-10-17 Fangkai Yang , Pu Zhao , Zezhong Wang , Lu Wang , Jue Zhang , Mohit Garg , Qingwei Lin , Saravan Rajmohan , Dongmei Zhang

Large Language Models (LLMs) have exhibited impressive generation capabilities, but they suffer from hallucinations when solely relying on their internal knowledge, especially when answering questions that require less commonly known…

Computation and Language · Computer Science 2023-11-01 Wenting Zhao , Ye Liu , Tong Niu , Yao Wan , Philip S. Yu , Shafiq Joty , Yingbo Zhou , Semih Yavuz

Dense retrieval has been shown to be effective for retrieving relevant documents for Open Domain QA, surpassing popular sparse retrieval methods like BM25. REALM (Guu et al., 2020) is an end-to-end dense retrieval system that relies on MLM…

Computation and Language · Computer Science 2021-04-20 Vidhisha Balachandran , Ashish Vaswani , Yulia Tsvetkov , Niki Parmar

Dense retrieval is a crucial task in Information Retrieval (IR), serving as the basis for downstream tasks such as re-ranking and augmenting generation. Recently, large language models (LLMs) have demonstrated impressive semantic…

Information Retrieval · Computer Science 2025-08-20 Hengran Zhang , Keping Bi , Jiafeng Guo , Xiaojie Sun , Shihao Liu , Daiting Shi , Dawei Yin , Xueqi Cheng

Closed-book question answering (QA) requires a model to directly answer an open-domain question without access to any external knowledge. Prior work on closed-book QA either directly finetunes or prompts a pretrained language model (LM) to…

Computation and Language · Computer Science 2023-04-28 Dan Su , Mostofa Patwary , Shrimai Prabhumoye , Peng Xu , Ryan Prenger , Mohammad Shoeybi , Pascale Fung , Anima Anandkumar , Bryan Catanzaro

Recently, large language models (LLMs) have gained much attention for the emergence of human-comparable capabilities and huge potential. However, for open-domain implicit question-answering problems, LLMs may not be the ultimate solution…

Computation and Language · Computer Science 2026-03-10 Chang Liu , Xiaoguang Li , Lifeng Shang , Xin Jiang , Qun Liu , Edmund Y. Lam , Ngai Wong

Large Language Models (LLMs), despite their advancements, are fundamentally limited by their static parametric knowledge, hindering performance on tasks requiring open-domain up-to-date information. While enabling LLMs to interact with…

Computation and Language · Computer Science 2025-05-27 Jianbiao Mei , Tao Hu , Daocheng Fu , Licheng Wen , Xuemeng Yang , Rong Wu , Pinlong Cai , Xinyu Cai , Xing Gao , Yu Yang , Chengjun Xie , Botian Shi , Yong Liu , Yu Qiao

In this paper, we introduce and apply Operations Research Question Answering (ORQA), a new benchmark designed to assess the generalization capabilities of Large Language Models (LLMs) in the specialized technical domain of Operations…

Open-domain Question Answering (OpenQA) is an important task in Natural Language Processing (NLP), which aims to answer a question in the form of natural language based on large-scale unstructured documents. Recently, there has been a surge…

Artificial Intelligence · Computer Science 2021-05-11 Fengbin Zhu , Wenqiang Lei , Chao Wang , Jianming Zheng , Soujanya Poria , Tat-Seng Chua

The development of large language models (LLMs) has achieved superior performance in a range of downstream tasks, including LLM-based retrieval-augmented generation (RAG). The quality of generated content heavily relies on the usefulness of…

Computation and Language · Computer Science 2026-01-27 Fengran Mo , Zhan Su , Yuchen Hui , Jinghan Zhang , Jia Ao Sun , Zheyuan Liu , Chao Zhang , Tetsuya Sakai , Jian-Yun Nie

Open-domain question answering relies on efficient passage retrieval to select candidate contexts, where traditional sparse vector space models, such as TF-IDF or BM25, are the de facto method. In this work, we show that retrieval can be…

Computation and Language · Computer Science 2020-10-02 Vladimir Karpukhin , Barlas Oğuz , Sewon Min , Patrick Lewis , Ledell Wu , Sergey Edunov , Danqi Chen , Wen-tau Yih

Information retrieval (IR) or knowledge retrieval, is a critical component for many down-stream tasks such as open-domain question answering (QA). It is also very challenging, as it requires succinctness, completeness, and correctness. In…

Computation and Language · Computer Science 2023-08-10 Xiaodong Yu , Ben Zhou , Dan Roth

In simple open-domain question answering (QA), dense retrieval has become one of the standard approaches for retrieving the relevant passages to infer an answer. Recently, dense retrieval also achieved state-of-the-art results in multi-hop…

Information Retrieval · Computer Science 2021-09-23 Georgios Sidiropoulos , Nikos Voskarides , Svitlana Vakulenko , Evangelos Kanoulas

Dense retrieval (DR) approaches based on powerful pre-trained language models (PLMs) achieved significant advances and have become a key component for modern open-domain question-answering systems. However, they require large amounts of…

Computation and Language · Computer Science 2022-08-08 Xiaoyu Shen , Svitlana Vakulenko , Marco del Tredici , Gianni Barlacchi , Bill Byrne , Adrià de Gispert
‹ Prev 1 2 3 10 Next ›