English(EN) Compact and Efficient Indexes for Learned Sparse Retrieval

新方法大幅降低了学习到的稀疏检索索引的内存占用

作者 PulseAugur 编辑部 · [1 个来源] · 2026-10-08 16:50

研究人员开发了新方法，可在不影响检索效率的情况下，显著降低学习到的稀疏检索索引的内存需求。所提出的技术包括在倒排索引中用文档中心点替换每块摘要，以及压缩前向索引中的组件和值。这些进展已集成到 KANNOLO 中并进行了 MS MARCO 评估，与现有方法相比，显示出高达 5.3 倍的速度提升和 3 倍的内存使用量减少。 AI

影响这些索引压缩技术可能带来更高效、更易于访问的大规模信息检索系统。

排序理由该集群包含一篇详细介绍新颖技术方法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.IR (Information Retrieval) 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇详细介绍新颖技术方法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, infra; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 19 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Rossano Venturini · 2026-10-08 16:50

用于学习稀疏检索的紧凑高效索引

This paper investigates how to substantially reduce the memory footprint of learned sparse retrieval indexes without sacrificing the efficiency of state-of-the-art retrieval data structures. Building on SEISMIC, we revisit both levels of its design: the inverted index used to sel…

本文如何被排名

报道来源 [1]

用于学习稀疏检索的紧凑高效索引

相关实体

相关话题