mlsanityData to 14 Oct 2026

Rescaling MLM-Head for Neural Sparse Retrieval

arXiv 2606.18811 ↗First posted 17 Jun 2026cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Learned sparse retrieval (LSR) models such as SPLADE have traditionally used BERT-style masked language models as backbone encoders. A natural expectation is that replacing BERT with stronger pretrained encoders should improve retrieval effectiveness. However, we find that under standard SPLADE training recipes, backbones with large MLM-head L2 norms can suffer performance degradation and even training collapse under standard SPLADE training recipes. We identify this failure as a scale mismatch in the MLM head: SPLADE directly uses MLM-head outputs to construct sparse lexical representations, and query-document relevance is computed by an unnormalized dot product over these representations. As a result, an inflated MLM-head scale can amplify sparse activations, distort matching scores, and destabilize contrastive training under common training settings. To address this issue, we introduce a simple initialization-time correction that rescales the MLM-head projection by a constant factor before SPLADE training. This zero-cost adjustment improves training stability without modifying the model architecture or training objective. Across both in-domain and out-of-domain retrieval benchmarks, this simple correction substantially improves large-norm backbones such as ModernBERT and Ettin, turning unstable training runs into competitive sparse retrievers. In several settings, the corrected models further match or surpass the classic BERT-SPLADE baseline. These findings suggest that the bottleneck in adapting pretrained encoders to LSR is not encoder capacity alone, but the calibration of the MLM-head scale used to construct sparse lexical representations.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 24 references that are in the map. First posted on arXiv 17 Jun 2026.

Builds on

19 of 24 references.

References · 19

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
  3. 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,261
  4. 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,253
  5. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  6. 2024M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillationcited by 1,073
  7. 2023Towards General Text Embeddings with Multi-stage Contrastive Learningcited by 723
  8. 2024Smarter, Better, Faster, Longer: A Modern Bidirectional Encoder for Fast, Memory Efficient, and Long Context Finetuning and Inferencecited by 554
  9. 2020Overview of the TREC 2019 deep learning trackcited by 286
  10. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 286
  11. 2024SPLADE-v3: New baselines for SPLADEcited by 72
  12. 2020Minimizing FLOPs to Learn Efficient Sparse Representationscited by 46
7 more
  1. 2025Seq vs Seq: An Open Suite of Paired Encoders and Decoderscited by 38
  2. 2024Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representationscited by 24
  3. 2023A Unified Framework for Learned Sparse Retrievalcited by 17
  4. 2023Exploring the Representation Power of SPLADE Modelscited by 5
  5. 2024Pairing Clustered Inverted Indexes with kNN Graphs for Fast Approximate Retrieval over Learned Sparse Representationscited by 5
  6. 2025Investigating the Scalability of Approximate Sparse Retrieval Algorithms to Massive Datasetscited by 4
  7. 2025The Role of Vocabularies in Learning Sparse Representations for Rankingcited by 4

Built on by

Not cited yet.