mlsanityData to 7 Oct 2026

Learning to Select: Query-Aware Adaptive Dimension Selection for Dense Retrieval

arXiv 2602.03306 ↗First posted 3 Feb 2026cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Dense retrieval represents queries and documents as high-dimensional embeddings, but these representations can be redundant at the query level: for a given information need, only a subset of dimensions is consistently helpful for ranking. Prior work addresses this via pseudo-relevance feedback (PRF) based dimension importance estimation, which can produce query-aware masks without labeled data but often relies on noisy pseudo signals and heuristic test-time procedures. In contrast, supervised adapter methods leverage relevance labels to improve embedding quality, yet they learn global transformations shared across queries and do not explicitly model query-aware dimension importance. We propose a Query-Aware Adaptive Dimension Selection framework that learns to predict per-dimension importance directly from query embedding. We first construct oracle dimension importance distributions over embedding dimensions using supervised relevance labels, and then train a predictor to map a query embedding to these label-distilled importance scores. At inference, the predictor selects a query-aware subset of dimensions for similarity computation based solely on the query embedding, without pseudo-relevance feedback. Experiments across multiple dense retrievers and benchmarks show that our learned dimension selector improves retrieval effectiveness over the full-dimensional baseline as well as PRF-based masking and supervised adapter baselines.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 19 references that are in the map. First posted on arXiv 3 Feb 2026.

Builds on

11 of 19 references.

References · 11

  1. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  2. 2017Billion-scale similarity search with GPUscited by 2,477
  3. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
  4. 2024LLM2Vec: Large Language Models Are Secretly Powerful Text Encoderscited by 396
  5. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
  6. 2024Generative Representational Instruction Tuningcited by 227
  7. 2024Matryoshka-Adaptor: Unsupervised and Supervised Tuning for Smaller Embedding Dimensionscited by 16
  8. 2025SMEC: Rethinking Matryoshka Representation Learning for Retrieval Embedding Compressioncited by 13
  9. 2023Search-Adaptor: Embedding Customization for Information Retrievalcited by 10
  10. 2024ECLIPSE: Contrastive Dimension Importance Estimation with Pseudo-Irrelevance Feedback for Dense Retrievalcited by 2
  11. 2026Statistical Foundations of DIME: Risk Estimation for Practical Index Selectioncited by 1

Built on by

Not cited yet.