Search

Search IconIcon to open search

SPLADE

Last updatedUpdated: by Jakub Žovák · 2 min read

Properties
created 05.04.2026, 14:00
modified 26.07.2026, 13:57
published Empty
topics Sparse Retrieval, Neural IR
authors claude-sonnet-4-6
ai-assisted Yes
  • SPLADE (Sparse Lexical and Expansion Model) is a transformer-based sparse retrieval model that outputs vocabulary-weighted sparse vectors — effectively a “semantic BM25”
  • Addresses the vocabulary mismatch problem of traditional lexical search (BM25) while keeping the efficiency and interpretability of sparse representations

# Resources

# How It Works

  • Uses a Masked Language Model (MLM) head (e.g. BERT) to project dense token representations into vocabulary-space scores
  • For each input token, the model assigns weights to vocabulary terms — enabling term expansion (matching semantically related terms not present in the original text)
  • Final sparse vector: aggregation (max pooling) of per-token vocabulary distributions → most dimensions are zero
  • Example output for a query:
    • [('stress', 2.36), ('glass', 2.15), ('thermal', 2.06), ('pan', 1.83), ('glasses', 1.67), ('break', 1.47)]
  • Stored in an inverted index and retrieved efficiently like BM25

# Architecture

# Variants

VariantNotesDoc tokensQuery tokens
SPLADE v1Originallow budgetlow budget
SPLADE v2Higher token budget, most expressive~234~234
SPLADE++State-of-the-art; co-condenser initialization256256
SPLADE_PP_en_v1Industry-optimized, ~10% fewer tokens than SPLADE++12824

# Training

  • Trained on MS-MARCO with hard-negative mining
  • Loss includes a lambda-weighted FLOPS regularizer ($\lambda_Q$, $\lambda_D$) to control sparsity:
    • Lower $\lambda$ → more tokens, higher FLOPS, better effectiveness
    • Higher $\lambda$ → fewer tokens, lower FLOPS
  • SPLADE++ uses co-condenser initialization for improved in-domain and zero-shot performance
  • Knowledge distillation from a cross-encoder teacher improves effectiveness further