English(EN) Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning

LLM引导的剪枝增强最近邻搜索索引

作者 PulseAugur 编辑部 · [1 个来源] · 2026-09-28 22:47

研究人员开发了一个名为LLM-Guided Graph Pruning (LGP) 的新框架，以提高近似最近邻搜索 (ANNS) 索引的性能。该方法使用大型语言模型 (LLMs) 来优化现有的 ANN 图索引，通过识别并用语义相关的替代项替换结构上价值较低的邻居。实验表明，LGP 在 DiskANN 和 HNSW 等各种 ANN 索引上都能提高端到端检索性能，优于传统的贪婪搜索和基于 LLM 的重新排序。 AI

影响该方法可能带来更高效、更准确的语义搜索系统，影响依赖于大规模信息检索的应用。

排序理由该集群包含一篇详细介绍改进AI相关基础设施的新方法的论文。[lever_c_demoted from research: ic=1 ai=1.0]

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

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

本文如何被排名

Signal score: 1 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇详细介绍改进AI相关基础设施的新方法的论文。[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: 1 days old; Coverage has settled into its steady-state source set.

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

报道来源 [1]

arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Sandeep Silwal · 2026-09-28 22:47

通过（高效）LLM引导的剪枝实现更好的最近邻图索引

Graph-based approximate nearest neighbor search (ANNS) is widely used for large-scale semantic search. Its indices are constructed primarily based on geometric relationships among embeddings of an input dataset (e.g., documents or images), rather than explicitly optimizing for se…

本文如何被排名

报道来源 [1]

通过（高效）LLM引导的剪枝实现更好的最近邻图索引

相关实体

相关话题