mlsanityData to 14 Oct 2026

Efficient and Interpretable Information Retrieval for Product Question Answering with Heterogeneous Data

arXiv 2405.13173 ↗First posted 21 May 2024cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Expansion-enhanced sparse lexical representation improves information retrieval (IR) by minimizing vocabulary mismatch problems during lexical matching. In this paper, we explore the potential of jointly learning dense semantic representation and combining it with the lexical one for ranking candidate information. We present a hybrid information retrieval mechanism that maximizes lexical and semantic matching while minimizing their shortcomings. Our architecture consists of dual hybrid encoders that independently encode queries and information elements. Each encoder jointly learns a dense semantic representation and a sparse lexical representation augmented by a learnable term expansion of the corresponding text through contrastive learning. We demonstrate the efficacy of our model in single-stage ranking of a benchmark product question-answering dataset containing the typical heterogeneous information available on online product pages. Our evaluation demonstrates that our hybrid approach outperforms independently trained retrievers by 10.95% (sparse) and 2.7% (dense) in MRR@5 score. Moreover, our model offers better interpretability and performs comparably to state-of-the-art cross encoders while reducing response time by 30% (latency) and cutting computational load by approximately 38% (FLOPs).

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 11 of its 25 references that are in the map. First posted on arXiv 21 May 2024.

Builds on

11 of 25 references.

References · 11

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
  5. 2017Billion-scale similarity search with GPUscited by 2,497
  6. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,178
  7. 2019Passage Re-ranking with BERTcited by 645
  8. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 286
  9. 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 214
  10. 2016Attention-Based Recurrent Neural Network Models for Joint Intent Detection and Slot Fillingcited by 137
  11. 2020SparTerm: Learning Term-based Sparse Representation for Fast Text Retrievalcited by 45

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.