mlsanityData to 14 Oct 2026

HARNESS-LM: A Three-Phase Training Recipe for Harnessing SLMs in Sponsored Search Retrieval

arXiv 2605.23572 ↗First posted 22 May 2026cs.IR cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

In the competitive landscape of sponsored search, balancing retrieval quality with production latency is a critical challenge. While large retrieval models based on Small Language Models (SLMs) such as Qwen3-Embedding-4B/8B set strong upper bounds on public benchmarks, their deployment in high-throughput, latency-sensitive environments remains impractical. In this paper, we present HARNESS-LM (HLM), a three-phase training framework for transferring the capabilities of large-scale retrievers into compact, cost-efficient models. The approach comprises: (1) training a high-performance reference ("teacher") retriever by fine-tuning a billion-parameter-scale SLM; (2) aligning query representations via an L2 objective to distill knowledge into a sub-600M parameter student encoder; and (3) applying a final contrastive refinement stage to optimize the student for retrieval performance. We also present a comprehensive empirical study of key design choices, including alignment objectives, embedding dimensionality, model scale, architecture, and optimization strategies, to identify configurations that are most effective in production settings. On a real-world Bing Ads evaluation benchmark, HLM recovers over 98% of the reference retriever's precision across multiple settings, while delivering up to 27x lower online query-encoder latency and 20x higher throughput on NVIDIA A100 GPUs. Online A/B testing on Bing Ads further shows a +1% Revenue, +0.6% Impression, and +0.4% Click uplift over the current ensemble of retrievers running in production with the deployed 190M parameter model, clearly highlighting the practical efficacy of the HLM recipe in a real-world sponsored search setting.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 25 references that are in the map. First posted on arXiv 22 May 2026.

Builds on

3 of 25 references.

References · 3

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  3. 2024Generative Representational Instruction Tuningcited by 233

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Search-R3: Unifying Reasoning and Embedding in Large Language Models
  2. 2026Are LLM-Based Retrievers Worth Their Cost? An Empirical Study of Efficiency, Robustness, and Reasoning Overhead
  3. 2026Mixture-of-Experts Language Models Can Be Strong and Efficient Retrievers
  4. 2025ExpandR: Teaching Dense Retrievers Beyond Queries with LLM Guidance
  5. 2023Query Rewriting for Retrieval-Augmented Large Language Models
  6. 2023Retrieval-Pretrained Transformer: Long-range Language Modeling with Self-retrieval
  7. 2025LMAR: Language Model Augmented Retriever for Domain-specific Knowledge Indexing
  8. 2025Scaling Up Efficient Small Language Models Serving and Deployment for Semantic Job Search