Sparsifying Sparse Representations for Passage Retrieval by Top-k Masking

12/17/2021
by   Jheng-Hong Yang, et al.
0

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 sparsifying lexical representations for passage retrieval, building on SPLADE by introducing a top-k masking scheme to control sparsity and a self-learning method to coax masked representations to mimic unmasked representations. A basic implementation of our model is competitive with more sophisticated approaches and achieves a good balance between effectiveness and efficiency. The simplicity of our methods opens the door for future explorations in lexical representation learning for passage retrieval.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2022

A Dense Representation Framework for Lexical and Semantic Matching

Lexical and semantic matching capture different successful approaches to...
research
07/12/2021

SPLADE: Sparse Lexical and Expansion Model for First Stage Ranking

In neural Information Retrieval, ongoing research is directed towards im...
research
12/09/2021

Densifying Sparse Representations for Passage Retrieval by Representational Slicing

Learned sparse and dense representations capture different successful ap...
research
06/20/2023

Representation Sparsification with Hybrid Thresholding for Fast SPLADE-based Document Retrieval

Learned sparse document representations using a transformer-based neural...
research
11/07/2019

Contextualized Sparse Representation with Rectified N-Gram Attention for Open-Domain Question Answering

A sparse representation is known to be an effective means to encode prec...
research
05/18/2018

Robust Handling of Polysemy via Sparse Representations

Words are polysemous and multi-faceted, with many shades of meanings. We...
research
05/02/2023

Optimizing Guided Traversal for Fast Learned Sparse Retrieval

Recent studies show that BM25-driven dynamic index skipping can greatly ...

Please sign up or login with your details

Forgot password? Click here to reset