mlsanityData to 14 Oct 2026

Expansion via Prediction of Importance with Contextualization

arXiv 2004.14245 ↗First posted 29 Apr 2020cs.IRcited by 26

Not on the map. Why?

Abstract (arXiv)

The identification of relevance with little textual context is a primary challenge in passage retrieval. We address this problem with a representation-based ranking approach that: (1) explicitly models the importance of each term using a contextualized language model; (2) performs passage expansion by propagating the importance to similar terms; and (3) grounds the representations in the lexicon, making them interpretable. Passage representations can be pre-computed at index time to reduce query-time latency. We call our approach EPIC (Expansion via Prediction of Importance with Contextualization). We show that EPIC significantly outperforms prior importance-modeling and document expansion approaches. We also observe that the performance is additive with the current leading first-stage retrieval methods, further narrowing the gap between inexpensive and cost-prohibitive passage ranking approaches. Specifically, EPIC achieves a MRR@10 of 0.304 on the MS-MARCO passage ranking dataset with 78ms average query latency on commodity hardware. We also find that the latency is further reduced to 68ms by pruning document representations, with virtually no difference in effectiveness.

Key facts. Cited by 26 papers in the map (data through 14 Oct 2026). First posted on arXiv 29 Apr 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 6; 2022: 2; 2023: 3; 2024: 5; 2025: 7; 2026: 3.

26 papers.

Sort:

By area:

  1. 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 127
  2. 2021mMARCO: A Multilingual Version of the MS MARCO Passage Ranking Datasetcited by 116
  3. 2022What Are You Token About? Dense Retrieval as Distributions Over the Vocabularycited by 28
  4. 2024Utilizing BERT for Information Retrieval: Survey, Applications, Resources, and Challengescited by 20
  5. 2021VisualSparta: An Embarrassingly Simple Approach to Large-scale Text-to-Image Search with Weighted Bag-of-wordscited by 14
  6. 2024Multimodal Learned Sparse Retrieval with Probabilistic Expansion Controlcited by 12
  7. 2023Evaluating Generative Ad Hoc Information Retrievalcited by 11
  8. 2025CSPLADE: Learned Sparse Retrieval with Causal Language Modelscited by 10
  9. 2025Milco: Learned Sparse Retrieval Across Languages via a Multilingual Connectorcited by 9
  10. 2024Towards Competitive Search Relevance For Inference-Free Learned Sparse Retrieverscited by 8
  11. 2023Lexically-Accelerated Dense Retrievalcited by 7
  12. 2024Shallow Cross-Encoders for Low-Latency Retrievalcited by 4
14 more
  1. 2024Few-shot Prompting for Pairwise Ranking: An Effective Non-Parametric Retrieval Modelcited by 4
  2. 2021Exploring Classic and Neural Lexical Translation Models for Information Retrieval: Interpretability, Effectiveness, and Efficiency Benefitscited by 3
  3. 2021On Single and Multiple Representations in Dense Passage Retrievalcited by 3
  4. 2023Adapting Learned Sparse Retrieval for Long Documentscited by 3
  5. 2025An Alternative to FLOPS Regularization to Effectively Productionize SPLADE-Doccited by 3
  6. 2026CodaRAG: Connecting the Dots with Associativity Inspired by Complementary Learningcited by 3
  7. 2025Rewrite-to-Rank: Optimizing Ad Visibility via Retrieval-Aware Text Rewritingcited by 2
  8. 2021Improving Transformer-Kernel Ranking Model Using Conformer and Query Term Independencecited by 1
  9. 2025Exploring ℓ0 Sparsification for Inference-free Sparse Retrieverscited by 1
  10. 2025Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Setscited by 1
  11. 2022Explainability of Text Processing and Retrieval Methods: A Surveycited by 0
  12. 2025ERU-KG: Efficient Reference-aligned Unsupervised Keyphrase Generationcited by 0
  13. 2026To Case or Not to Case: An Empirical Study in Learned Sparse Retrievalcited by 0
  14. 2026From Tokens to Concepts: Leveraging SAE for SPLADEcited by 0