English
Related papers

Related papers: DETQUS: Decomposition-Enhanced Transformers for QU…

200 papers

Query-focused summarization (QFS) aims to provide a summary of a document that satisfies information need of a given query and is useful in various IR applications, such as abstractive snippet generation. Current QFS approaches typically…

Information Retrieval · Computer Science 2023-04-25 Zhichao Xu , Daniel Cohen

Query Expansion (QE) enriches queries and Document Expansion (DE) enriches documents, and these two techniques are often applied separately. However, such separate application may lead to semantic misalignment between the expanded queries…

Information Retrieval · Computer Science 2025-12-22 Yu Yang , Feng Tian , Ping Chen

Large transformer models, such as BERT, achieve state-of-the-art results in machine reading comprehension (MRC) for open-domain question answering (QA). However, transformers have a high computational cost for inference which makes them…

Computation and Language · Computer Science 2021-08-06 Haytham ElFadeel , Stan Peshterliev

Spoken Language Understanding (SLU) systems must balance performance and efficiency, particularly in resource-constrained environments. Existing methods apply distillation and quantization separately, leading to suboptimal compression as…

Audio and Speech Processing · Electrical Eng. & Systems 2025-08-18 Subrata Biswas , Mohammad Nur Hossain Khan , Bashima Islam

Attribution is crucial in question answering (QA) with Large Language Models (LLMs).SOTA question decomposition-based approaches use long form answers to generate questions for retrieving related documents. However, the generated questions…

Computation and Language · Computer Science 2025-11-17 Zhichao Yan , Jiaoyan Chen , Jiapu Wang , Xiaoli Li , Ru Li , Jeff Z. Pan

Scoring the factuality of a generated summary involves measuring the degree to which a target text contains factual information using the input document as support. Given the similarities in the problem formulation, previous work has shown…

Computation and Language · Computer Science 2022-12-01 John Glover , Federico Fancellu , Vasudevan Jagannathan , Matthew R. Gormley , Thomas Schaaf

The computing cost of transformer self-attention often necessitates breaking long documents to fit in pretrained models in document ranking tasks. In this paper, we design Query-Directed Sparse attention that induces IR-axiomatic structures…

Artificial Intelligence · Computer Science 2020-10-27 Jyun-Yu Jiang , Chenyan Xiong , Chia-Jung Lee , Wei Wang

Sequence-to-sequence neural networks have recently achieved great success in abstractive summarization, especially through fine-tuning large pre-trained language models on the downstream dataset. These models are typically decoded with beam…

Computation and Language · Computer Science 2023-05-29 Mathieu Ravaut , Shafiq Joty , Nancy F. Chen

Regardless of the rapid development of artificial intelligence, abstractive summarisation is still challenging for sensitive and data-restrictive domains like medicine. With the increasing number of imaging, the relevance of automated tools…

Computation and Language · Computer Science 2025-09-22 Claudio Benzoni , Martina Langhals , Martin Boeker , Luise Modersohn , Máté E. Maros

Encoder-only transformer models have been successfully applied to different table understanding tasks, as in TAPAS (Herzig et al., 2020). A major limitation of these architectures is that they are constrained to classification-like tasks…

Computation and Language · Computer Science 2022-10-18 Ewa Andrejczuk , Julian Martin Eisenschlos , Francesco Piccinno , Syrine Krichene , Yasemin Altun

Summarization systems make numerous "decisions" about summary properties during inference, e.g. degree of copying, specificity and length of outputs, etc. However, these are implicitly encoded within model parameters and specific styles…

Computation and Language · Computer Science 2022-10-24 Tanya Goyal , Nazneen Fatema Rajani , Wenhao Liu , Wojciech Kryściński

Large Language Models (LMs) have achieved state-of-the-art performance on many Natural Language Processing (NLP) benchmarks. With the growing number of new benchmarks, we build bigger and more complex LMs. However, building new LMs may not…

Computation and Language · Computer Science 2022-10-28 Pruthvi Patel , Swaroop Mishra , Mihir Parmar , Chitta Baral

Effective document reranking is essential for improving search relevance across diverse applications. While Large Language Models (LLMs) excel at reranking due to their deep semantic understanding and reasoning, their high computational…

Computation and Language · Computer Science 2025-10-03 Dimitar Peshevski , Kiril Blazhevski , Martin Popovski , Gjorgji Madjarov

Recently, large language models (LLMs) have shown surprising performance in task-specific workloads as well as general tasks with the given prompts. However, to achieve unprecedented performance, recent LLMs use billions to trillions of…

Machine Learning · Computer Science 2024-06-21 Geonhwa Jeong , Po-An Tsai , Stephen W. Keckler , Tushar Krishna

To migrate the remarkable successes of Large Language Models (LLMs), the community has made numerous efforts to generalize them to the table reasoning tasks for the widely deployed tabular data. Despite that, in this work, by showing a…

Computation and Language · Computer Science 2026-01-08 Liyao Li , Chao Ye , Wentao Ye , Yifei Sun , Zhe Jiang , Haobo Wang , Jiaming Tian , Yiming Zhang , Ningtao Wang , Xing Fu , Gang Chen , Junbo Zhao

An emerging solution for explaining Transformer-based models is to use vector-based analysis on how the representations are formed. However, providing a faithful vector-based explanation for a multi-layer model could be challenging in three…

Computation and Language · Computer Science 2023-06-06 Ali Modarressi , Mohsen Fayyaz , Ehsan Aghazadeh , Yadollah Yaghoobzadeh , Mohammad Taher Pilehvar

Weakly-supervised table question-answering(TableQA) models have achieved state-of-art performance by using pre-trained BERT transformer to jointly encoding a question and a table to produce structured query for the question. However, in…

Larger models often outperform smaller ones but come with high computational costs. Cascading offers a potential solution. By default, it uses smaller models and defers only some instances to larger, more powerful models. However, designing…

Computation and Language · Computer Science 2025-02-19 António Farinhas , Nuno M. Guerreiro , Sweta Agrawal , Ricardo Rei , André F. T. Martins

Conversational search seeks to retrieve relevant passages for the given questions in conversational question answering. Conversational Query Reformulation (CQR) improves conversational search by refining the original queries into…

Computation and Language · Computer Science 2025-05-16 Jeonghyun Park , Hwanhee Lee

Context modeling plays a critical role in building multi-turn dialogue systems. Conversational Query Rewriting (CQR) aims to simplify the multi-turn dialogue modeling into a single-turn problem by explicitly rewriting the conversational…

Computation and Language · Computer Science 2021-02-22 Hang Liu , Meng Chen , Youzheng Wu , Xiaodong He , Bowen Zhou