Dimension Importance Estimation for Dense Information Retrieval
Guglielmo Faggioli, Nicola Ferro, Raffaele Perego, Nicola Tonellotto
Abstract
Recent advances in Information Retrieval have shown the effectiveness of embedding queries and documents in a latent high-dimensional space to compute their similarity. While operating on such high-dimensional spaces is effective, in this paper, we hypothesize that we can improve the retrieval performance by adequately moving to a query-dependent subspace. More in detail, we formulate the Manifold Clustering (MC) Hypothesis: projecting queries and documents onto a subspace of the original representation space can improve retrieval effectiveness. To empirically validate our hypothesis, we define a novel class of Dimension IMportance Estimators (DIME). Such models aim to determine how much each dimension of a high-dimensional representation contributes to the quality of the final ranking and provide an empirical method to select a subset of dimensions where to project the query and the documents. To support our hypothesis, we propose an oracle DIME, capable of effectively selecting dimensions and almost doubling the retrieval performance. To show the practical applicability of our approach, we then propose a set of DIMEs that do not require any oracular piece of information to estimate the importance of dimensions. These estimators allow us to carry out a dimensionality selection that enables performance improvements of up to +11.5% (moving from 0.675 to 0.752 nDCG@10) compared to the baseline methods using all dimensions. Finally, we show that, with simple and realistic active feedback, such as the user's interaction with a single relevant document, we can design a highly effective DIME, allowing us to outperform the baseline by up to +0.224 nDCG@10 points (+58.6%, moving from 0.384 to 0.608).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a44dd697-7197-42ab-b511-dda47f4559ffCited by top-tier papers2
- Learning to Select: Query-Aware Adaptive Dimension Selection for Dense RetrievalZhanyu Wu, Richong Zhang, Zhijie NieACL 2026
- Self-Improving Sparse Retrieval Through Heuristic Representation Refinement and Representation-Focused LearningXiaojing Li, Bin Wang, Xiaochun Yang, Meng LuoAAAI 2026
Builds on7
- Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text RetrievalLee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang et al.ICLR 2021 · 1,547 citations
- The Intrinsic Dimension of Images and Its Impact on LearningPhillip Pope, Chen Zhu, Ahmed Abdelkader, Micah Goldblum et al.ICLR 2021 · 381 citations
- Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware SamplingSebastian Hofstätter, Sheng-Chieh Lin, Jheng-Hong Yang, Jimmy Lin et al.SIGIR 2021 · 297 citations
- Optimizing Dense Retrieval Model Training with Hard NegativesJingtao Zhan, Jiaxin Mao, Yiqun Liu, Jiafeng Guo et al.SIGIR 2021 · 242 citations
- Emergence of Separable Manifolds in Deep Language RepresentationsJonathan Mamou, Hang Le, Miguel Del Rio, Cory Stephenson et al.ICML 2020 · 52 citations
Related papers
- CoDIME: A Counterfactual Approach for Dimension Importance Estimation through Click LogsGuglielmo Faggioli, Nicola Ferro, Raffaele Perego, Nicola TonellottoSIGIR 2025 · 2 citations
- Improving Document Representations by Generating Pseudo Query Embeddings for Dense RetrievalHongyin Tang, Xingwu Sun, Beihong Jin, Jingang Wang et al.ACL 2021
- MA-DPR: Manifold-aware Distance Metrics for Dense Passage RetrievalYifan Liu, Qianfeng Wen, Mark Zhao, Jiazhou Liang et al.EMNLP 2025 · 5 citations
- Implicit Relative Labeling-Importance Aware Multi-Label Metric LearningJunxiang Mao, Yong Rui, Min-Ling ZhangAAAI 2025 · 3 citations
- Towards Escaping from Class Dependency Modeling for Multi-Dimensional ClassificationTeng Huang, Bin-Bin Jia, Min-Ling ZhangICML 2025
