English
Related papers

Related papers: Efficiency and Effectiveness of SPLADE Models on B…

200 papers

There are many scenarios where we may want to find pairs of textually similar documents in a large corpus (e.g. a researcher doing literature review, or an R&D project manager analyzing project proposals). To programmatically discover those…

Computation and Language · Computer Science 2020-12-16 Carlos Badenes-Olmedo , Jose-Luis Redondo García , Oscar Corcho

Despite the advantages of their low-resource settings, traditional sparse retrievers depend on exact matching approaches between high-dimensional bag-of-words (BoW) representations of both the queries and the collection. As a result,…

Information Retrieval · Computer Science 2022-08-11 Dahlia Shehata , Negar Arabzadeh , Charles L. A. Clarke

Learned Sparse Retrievers (LSR) have evolved into an effective retrieval strategy that can bridge the gap between traditional keyword-based sparse retrievers and embedding-based dense retrievers. At its core, learned sparse retrievers try…

Information Retrieval · Computer Science 2024-08-23 Meet Doshi , Vishwajeet Kumar , Rudra Murthy , Vignesh P , Jaydeep Sen

Sparse lexical representation learning has demonstrated much progress in improving passage retrieval effectiveness in recent models such as DeepImpact, uniCOIL, and SPLADE. This paper describes a straightforward yet effective approach for…

Information Retrieval · Computer Science 2021-12-20 Jheng-Hong Yang , Xueguang Ma , Jimmy Lin

BM25, a widely-used lexical search algorithm, remains crucial in information retrieval despite the rise of pre-trained and large language models (PLMs/LLMs). However, it neglects query-document similarity and lacks semantic understanding,…

Information Retrieval · Computer Science 2024-08-15 Xianming Li , Julius Lipp , Aamir Shakir , Rui Huang , Jing Li

Large Language Models (LLMs) have demonstrated some significant capabilities across various domains; however, their effectiveness in spreadsheet related tasks remains underexplored. This study introduces a foundation for a comprehensive…

Software Engineering · Computer Science 2025-06-24 Simon Thorne

Compact dual-encoder models are widely used for retrieval owing to their efficiency and scalability. However, such models often underperform compared to their Large Language Model (LLM)-based retrieval counterparts, likely due to their…

Information Retrieval · Computer Science 2025-09-23 Pranjal A. Chitale , Bishal Santra , Yashoteja Prabhu , Amit Sharma

Despite considerable progress in neural relevance ranking techniques, search engines still struggle to process complex queries effectively - both in terms of precision and recall. Sparse and dense Pseudo-Relevance Feedback (PRF) approaches…

Information Retrieval · Computer Science 2023-12-06 Iain Mackie , Shubham Chatterjee , Sean MacAvaney , Jeffrey Dalton

Learned sparse retrieval models such as SPLADE combine the effectiveness of neural architectures with the efficiency of inverted indices. As these models assign weights to terms from a fixed vocabulary, interpretability is often touted as a…

Information Retrieval · Computer Science 2026-05-20 Gregory Polyakov , Harrisen Scells , Carsten Eickhoff

Efficient semantic access to industrial product data is a key enabler for factory automation and emerging LLM-based agent workflows, where both human engineers and autonomous agents must identify suitable components from highly structured…

Information Retrieval · Computer Science 2026-04-22 Nico Baumgart , Markus Lange-Hegermann , Jan Henze

Learned sparse document representations using a transformer-based neural model has been found to be attractive in both relevance effectiveness and time efficiency. This paper describes a representation sparsification scheme based on hard…

Information Retrieval · Computer Science 2023-06-21 Yifan Qiao , Yingrui Yang , Shanxiu He , Tao Yang

In enterprise search, building high-quality datasets at scale remains a central challenge due to the difficulty of acquiring labeled data. To resolve this challenge, we propose an efficient approach to fine-tune small language models (SLMs)…

Query expansion is an effective approach for mitigating vocabulary mismatch between queries and documents in information retrieval. One recent line of research uses language models to generate query-related contexts for expansion. Along…

Computation and Language · Computer Science 2022-10-14 Linqing Liu , Minghan Li , Jimmy Lin , Sebastian Riedel , Pontus Stenetorp

Large language models (LLMs) have been widely used for relevance assessment in information retrieval. However, our study demonstrates that combining two distinct small language models (SLMs) with different architectures can outperform LLMs…

Computation and Language · Computer Science 2025-05-13 Ohjoon Kwon , Changsu Lee , Jihye Back , Lim Sun Suk , Inho Kang , Donghyeon Jeon

Large Language Models (LLMs) have demonstrated impressive quality when applied to predictive tasks such as relevance ranking and semantic search. However, deployment of such LLMs remains prohibitively expensive for industry applications…

Scaling large language models (LLMs) has shown great potential for improving retrieval model performance; however, previous studies have mainly focused on dense retrieval trained with contrastive loss (CL), neglecting the scaling behavior…

Information Retrieval · Computer Science 2025-02-24 Hansi Zeng , Julian Killingback , Hamed Zamani

Large Language Models (LLMs) have achieved remarkable success across many applications, with Mixture of Experts (MoE) models demonstrating great potential. Compared to traditional dense models, MoEs achieve better performance with less…

Machine Learning · Computer Science 2026-02-17 Zongle Huang , Lei Zhu , Zongyuan Zhan , Ting Hu , Weikai Mao , Xianzhi Yu , Yongpan Liu , Tianyu Zhang

The detection and extraction of abbreviations from unstructured texts can help to improve the performance of Natural Language Processing tasks, such as machine translation and information retrieval. However, in terms of publicly available…

Computation and Language · Computer Science 2022-05-02 Leonardo Zilio , Hadeel Saadany , Prashant Sharma , Diptesh Kanojia , Constantin Orăsan

This paper revisits cluster-based retrieval that partitions the inverted index into multiple groups and skips the index partially at cluster and document levels during online inference using a learned sparse representation. It proposes an…

Information Retrieval · Computer Science 2024-04-16 Yifan Qiao , Shanxiu He , Yingrui Yang , Parker Carlson , Tao Yang

Learned sparse retrieval systems aim to combine the effectiveness of contextualized language models with the scalability of conventional data structures such as inverted indexes. Nevertheless, the indexes generated by these systems exhibit…

Information Retrieval · Computer Science 2024-05-03 Antonio Mallia , Torten Suel , Nicola Tonellotto