单向量嵌入在检索中表现差,因领域偏移和语义错位,微调也难补救。
On Strengths and Limitations of Single-Vector Embeddings
- 通过控制分词与语言相似性,发现性能提升有限,说明问题不在这些因素。
- 领域迁移和嵌入相似性与相关性不匹配是主因,微调可显著提升召回率。
- 单向量模型易灾难性遗忘,且远弱于多向量模型,根本缺陷难以克服。
近期研究(Weller等,2025)引入自然语料数据集LIMIT,实证发现多种主流单向量嵌入模型在检索中质量大幅下降,引发对其可靠性担忧。尽管该研究将原因归为维度低,但我们发现维度本身无法解释失败。从(Alon等,2016)可知,仅需$2k+1$维即可实现top-$k$检索。控制分词伪影与属性间语言相似性后,性能改善有限。相反,我们发现领域偏移及嵌入相似性与任务真实相关性不匹配是主要因素;微调可缓解此问题并显著提升召回。即便如此,单向量模型仍明显弱于多向量表示,暴露其根本局限。此外,在类似LIMIT的数据集上微调单向量模型会导致灾难性遗忘(MSMARCO性能下降超40%),而多向量模型遗忘极小。为理解两者差距,我们研究了‘文档淹没’现象(Reimers & Gurevych, 2021;Jacob等,2025):随着语料库增长,相关文档因嵌入相似性部分表现为噪声统计代理而被淹没。通过实验与数学建模,我们阐明单向量模型更易受此影响。
原文摘要 · Abstract (English)
Recent work (Weller et al., 2025) introduced a naturalistic dataset called LIMIT and showed empirically that a wide range of popular single-vector embedding models suffer substantial drops in retrieval quality, raising concerns about the reliability of single-vector embeddings for retrieval. Although (Weller et al., 2025) proposed limited dimensionality as the main factor contributing to this, we show that dimensionality alone cannot explain the observed failures. We observe from results in (Alon et al., 2016) that $2k+1$-dimensional vector embeddings suffice for top-$k$ retrieval. This result points to other drivers of poor performance. Controlling for tokenization artifacts and linguistic similarity between attributes yields only modest gains. In contrast, we find that domain shift and misalignment between embedding similarities and the task's underlying notion of relevance are major contributors; finetuning mitigates these effects and can improve recall substantially. Even with finetuning, however, single-vector models remain markedly weaker than multi-vector representations, pointing to fundamental limitations. Moreover, finetuning single-vector models on LIMIT-like datasets leads to catastrophic forgetting (performance on MSMARCO drops by more than 40%), whereas forgetting for multi-vector models is minimal. To better understand the gap between performance of single-vector and multi-vector models, we study the drowning in documents paradox (Reimers \& Gurevych, 2021; Jacob et al., 2025): as the corpus grows, relevant documents are increasingly "drowned out" because embedding similarities behave, in part, like noisy statistical proxies for relevance. Through experiments and mathematical calculations on toy mathematical models, we illustrate why single-vector models are more susceptible to drowning effects compared to multi-vector models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。