English
Related papers

Related papers: FastFiD: Improve Inference Efficiency of Open Doma…

200 papers

Speculative decoding accelerates autoregressive generation by letting draft tokens bypass full verification, but conventional frameworks suffer from frequent false rejections, particularly when draft models produce semantically correct but…

Computation and Language · Computer Science 2026-04-16 Xuwen Zhou , Fangxin Liu , Chao Wang , Xiao Zheng , Hao Zheng , Min He , Li Jiang , Haibing Guan

High quality arguments are essential elements for human reasoning and decision-making processes. However, effective argument construction is a challenging task for both human and machines. In this work, we study a novel task on…

Computation and Language · Computer Science 2018-05-28 Xinyu Hua , Lu Wang

Speculative decoding accelerates large language model inference by pairing a target model with a lightweight draft model whose proposed tokens are verified in parallel. A common way to build draft models, like EAGLE3 or DFlash is supervised…

Computation and Language · Computer Science 2026-05-29 Haodi Lei , Yafy Li , Haoran Zhang , Shunkai Zhang , Qianjia Cheng , Xiaoye Qu , Ganqu Cui , Bowen Zhou , Ning Ding , Yun Luo , Yu Cheng

Speculative decoding is widely adopted to reduce latency in large language model (LLM) inference by leveraging smaller draft models capable of handling diverse user tasks. However, emerging AI applications, such as LLM-based agents, present…

Computation and Language · Computer Science 2025-10-09 Gabriele Oliaro , Zhihao Jia , Daniel Campos , Aurick Qiao

Dense retrieval methods have shown great promise over sparse retrieval methods in a range of NLP problems. Among them, dense phrase retrieval-the most fine-grained retrieval unit-is appealing because phrases can be directly used as the…

Computation and Language · Computer Science 2021-09-17 Jinhyuk Lee , Alexander Wettig , Danqi Chen

Retrieval-augmented generation (RAG) has received much attention for Open-domain question-answering (ODQA) tasks as a means to compensate for the parametric knowledge of large language models (LLMs). While previous approaches focused on…

Computation and Language · Computer Science 2024-09-30 Minsang Kim , Cheoneum Park , Seungjun Baek

Weakly-supervised text classification aims to train a classifier using only class descriptions and unlabeled data. Recent research shows that keyword-driven methods can achieve state-of-the-art performance on various tasks. However, these…

Computation and Language · Computer Science 2022-12-16 Tingyu Xia , Yue Wang , Yuan Tian , Yi Chang

Automatic question generation can benefit many applications ranging from dialogue systems to reading comprehension. While questions are often asked with respect to long documents, there are many challenges with modeling such long documents.…

Computation and Language · Computer Science 2019-10-24 Luu Anh Tuan , Darsh J Shah , Regina Barzilay

Large Language Models (LLMs) are increasingly applied in various science domains, yet their broader adoption remains constrained by a critical challenge: the lack of trustworthy, verifiable outputs. Current LLMs often generate answers…

Computation and Language · Computer Science 2025-09-25 João Eduardo Batista , Emil Vatai , Mohamed Wahib

This work presents a novel four-stage open-domain QA pipeline R2-D2 (Rank twice, reaD twice). The pipeline is composed of a retriever, passage reranker, extractive reader, generative reader and a mechanism that aggregates the final…

Computation and Language · Computer Science 2021-09-09 Martin Fajcik , Martin Docekal , Karel Ondrej , Pavel Smrz

Recent studies on open-domain question answering have achieved prominent performance improvement using pre-trained language models such as BERT. State-of-the-art approaches typically follow the "retrieve and read" pipeline and employ…

Computation and Language · Computer Science 2020-03-02 Yuyu Zhang , Ping Nie , Xiubo Geng , Arun Ramamurthy , Le Song , Daxin Jiang

Reliable evaluation of large language models is essential to ensure their applicability in practical scenarios. Traditional benchmark-based evaluation methods often rely on fixed reference answers, limiting their ability to capture…

Computation and Language · Computer Science 2025-10-02 Sujeong Lee , Hayoung Lee , Seongsoo Heo , Wonik Choi

We present an end-to-end differentiable training method for retrieval-augmented open-domain question answering systems that combine information from multiple retrieved documents when generating answers. We model retrieval decisions as…

Computation and Language · Computer Science 2021-12-07 Devendra Singh Sachan , Siva Reddy , William Hamilton , Chris Dyer , Dani Yogatama

Recently, open-domain question answering (QA) has been combined with machine comprehension models to find answers in a large knowledge source. As open-domain QA requires retrieving relevant documents from text corpora to answer questions,…

Computation and Language · Computer Science 2018-10-02 Jinhyuk Lee , Seongjun Yun , Hyunjae Kim , Miyoung Ko , Jaewoo Kang

We introduce EXIT, an extractive context compression framework that enhances both the effectiveness and efficiency of retrieval-augmented generation (RAG) in question answering (QA). Current RAG systems often struggle when retrieval models…

Computation and Language · Computer Science 2025-05-30 Taeho Hwang , Sukmin Cho , Soyeong Jeong , Hoyun Song , SeungYoon Han , Jong C. Park

State-of-the-art Machine Reading Comprehension (MRC) models for Open-domain Question Answering (QA) are typically trained for span selection using distantly supervised positive examples and heuristically retrieved negative examples. This…

Computation and Language · Computer Science 2020-10-22 Srinivasan Iyer , Sewon Min , Yashar Mehdad , Wen-tau Yih

Open-Domain Generative Question Answering has achieved impressive performance in English by combining document-level retrieval with answer generation. These approaches, which we refer to as GenQA, can generate complete sentences,…

Computation and Language · Computer Science 2022-12-20 Benjamin Muller , Luca Soldaini , Rik Koncel-Kedziorski , Eric Lind , Alessandro Moschitti

Term frequency is a common method for identifying the importance of a term in a query or document. But it is a weak signal, especially when the frequency distribution is flat, such as in long queries or short documents where the text is of…

Information Retrieval · Computer Science 2019-11-28 Zhuyun Dai , Jamie Callan

Many open-domain questions are under-specified and thus have multiple possible answers, each of which is correct under a different interpretation of the question. Answering such ambiguous questions is challenging, as it requires retrieving…

Computation and Language · Computer Science 2023-08-21 Haitian Sun , William W. Cohen , Ruslan Salakhutdinov

Open-domain Question Answering models which directly leverage question-answer (QA) pairs, such as closed-book QA (CBQA) models and QA-pair retrievers, show promise in terms of speed and memory compared to conventional models which retrieve…

Computation and Language · Computer Science 2021-02-16 Patrick Lewis , Yuxiang Wu , Linqing Liu , Pasquale Minervini , Heinrich Küttler , Aleksandra Piktus , Pontus Stenetorp , Sebastian Riedel