Research Papers 论文研究 4h ago Updated 2h ago 更新于 2小时前 43

H+ Embedding: Harmonizing Global and Token-Level Retrieval with Context-Dependent Phrases H+ 嵌入:通过上下文依赖短语协调全局与词元级检索

H+ Embedding introduces a unified multi-granularity retriever that bridges the gap between single-vector global retrieval and token-level late interaction by using context-dependent phrase partitions as intermediate retrieval units The model predicts variable-length phrase partitions, preserves uncovered tokens as singletons, and applies importance-guided unit selection with weighted MaxSim interaction Across 16 scientific, medical, and bilingual tasks, the phrase retrieval branch outperforms th 提出H+ Embedding多粒度检索器,通过上下文相关短语平衡全局向量压缩与token级细粒度交互 短语检索分支在16个科学、医疗和多语言任务上比全局检索提升6.91 macro nDCG@10 使用13.7%更少文档向量,性能接近token级交互,为检索系统提供质量-成本平衡方案 在中等向量预算下优于内容独立的分组规则,验证了短语单元作为中间表示的有效性

55
Hot 热度
70
Quality 质量
60
Impact 影响力

Analysis 深度分析

TL;DR

  • H+ Embedding introduces a unified multi-granularity retriever that bridges the gap between single-vector global retrieval and token-level late interaction by using context-dependent phrase partitions as intermediate retrieval units
  • The model predicts variable-length phrase partitions, preserves uncovered tokens as singletons, and applies importance-guided unit selection with weighted MaxSim interaction
  • Across 16 scientific, medical, and bilingual tasks, the phrase retrieval branch outperforms the global retrieval branch by 6.91 macro nDCG@10
  • H+ Embedding nearly matches token-level performance while using 13.7% fewer document vectors, offering a superior quality-cost tradeoff
  • Context-dependent phrase interaction provides a practical intermediate point between global compression and token-level interaction for real-world retrieval systems

Why It Matters

This work directly addresses a critical bottleneck in terminology-intensive retrieval—particularly in medical and scientific domains—where preserving multi-word entities, abbreviations, and compositional concepts is essential. By offering a middle ground between over-compressed global vectors and computationally expensive token-level interaction, H+ Embedding gives practitioners a scalable alternative that maintains high retrieval quality without the storage and scoring overhead of full token-level approaches.

Technical Details

  • Multi-granularity architecture: H+ Embedding operates as a unified retriever with both a global vector branch and a phrase-based branch, enabling flexible deployment depending on resource constraints
  • Context-dependent phrase partitioning: The model predicts variable-length phrase boundaries from the input context rather than relying on fixed or content-independent grouping rules, allowing it to capture domain-specific multi-word entities like medical terminology and abbreviations
  • Importance-guided unit selection with weighted MaxSim: After phrase partitioning, uncovered tokens are preserved as singletons, and the system applies importance-weighted MaxSim interaction to score relevance between query and document units
  • Benchmark evaluation: Tested across 16 scientific, medical, and bilingual retrieval tasks, demonstrating a 6.91 macro nDCG@10 improvement over global retrieval and near-parity with token-level retrieval at 13.7% fewer document vectors

Industry Insight

  • Retrieval systems in regulated or terminology-heavy domains (healthcare, legal, scientific literature) should evaluate multi-granularity approaches like H+ Embedding to balance accuracy and infrastructure costs, especially where token-level late interaction is prohibitively expensive
  • The context-dependent phrase partitioning strategy could be adapted beyond retrieval to other NLP tasks requiring preservation of compositional entities, such as question answering over specialized corpora
  • As vector budgets remain a practical constraint for large-scale deployment, the 13.7% vector reduction while maintaining near-token-level performance makes this approach attractive for production systems seeking to optimize the quality-cost frontier

TL;DR

  • 提出H+ Embedding多粒度检索器,通过上下文相关短语平衡全局向量压缩与token级细粒度交互
  • 短语检索分支在16个科学、医疗和多语言任务上比全局检索提升6.91 macro nDCG@10
  • 使用13.7%更少文档向量,性能接近token级交互,为检索系统提供质量-成本平衡方案
  • 在中等向量预算下优于内容独立的分组规则,验证了短语单元作为中间表示的有效性

为什么值得看

这篇论文针对术语密集型检索场景(尤其是医疗领域)提出了全局向量与token级检索之间的中间方案,解决了现有方法在压缩与细粒度之间的两难困境。对于构建高效检索系统的工程师和研究人员具有重要参考价值。

技术解析

  • H+ Embedding采用可变长度短语分区策略,预测上下文相关的短语单元,将未覆盖token保留为单例,实现多粒度统一检索
  • 引入重要性引导的单元选择机制与加权MaxSim交互,在保留局部相关性信号的同时控制计算开销
  • 在16个科学、医疗和多语言任务上验证,短语检索分支比全局检索提升6.91 macro nDCG@10,且使用13.7%更少文档向量
  • 相比token级晚期交互方法,在中等向量预算下显著降低索引、存储和评分成本,同时保持接近的性能

行业启示

  • 多粒度检索是平衡性能与成本的有效方向,术语密集型领域(医疗、法律、科学)可优先采用
  • 上下文相关的短语单元可作为全局向量与token之间的中间表示,为检索系统架构设计提供新思路
  • 在实际部署中,可根据向量预算灵活选择检索粒度,实现质量与效率的最优权衡

Disclaimer: The above content is generated by AI and is for reference only. 免责声明:以上内容由 AI 生成,仅供参考。

Embedding Model 嵌入模型 RAG 检索增强生成 Research 科学研究