PulseAugur
中
实时 11:58:51
English(EN) Static Pruning Across Sparse Retrieval Regimes: What Transfers, What Breaks, and What Still Helps

新研究探讨静态剪枝和基于LLM的查询扩展在检索系统中的应用

两篇新研究论文探讨了改进信息检索系统的方法。第一篇论文《稀疏检索机制下的静态剪枝》研究了静态剪枝技术如何在不同检索引擎中应用,发现索引端剪枝能持续降低延迟和索引大小,而查询剪枝常被现代系统内化。第二篇论文《Dense Expands, Sparse Anchors》介绍了DESA,一种通道非对称查询扩展方法,它使用LLM生成互补的段落,提高了检索效果并降低了混合检索系统的访问深度。 AI

影响 这些论文在检索效率和效果方面提供了进步,可能影响搜索引擎性能和LLM集成。

排序理由 两篇在arXiv上发表的独立研究论文,详细介绍了信息检索的新方法。

在 arXiv cs.AI 阅读 →

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

新研究探讨静态剪枝和基于LLM的查询扩展在检索系统中的应用

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Research
两篇在arXiv上发表的独立研究论文,详细介绍了信息检索的新方法。
Source corroboration
7 independent sources
Strong cross-source corroboration — multiple independent publishers covered this within the clustering window.
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
52 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.
Coverage growth since scoring
+3 source(s) since last score
New sources have picked up this story since our last re-score. Score will update on the next scoring pass.

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

报道来源 [7]

  1. arXiv cs.CL TIER_1 English(EN) · Zhichao Xu, Shengyao Zhuang, Crystina Zhang, Xueguang Ma, Yijun Tian, Maitrey Mehta, Jimmy Lin, Vivek Srikumar ·

    LACONIC:通过两阶段训练课程实现可扩展稀疏检索的密集级有效性

    arXiv:2601.01684v2 Announce Type: replace-cross Abstract: While dense retrieval models have been the standard for state-of-the-art information retrieval, their deployment is often constrained by high memory requirements and reliance on GPU accelerators for vector similarity searc…

  2. arXiv cs.AI TIER_1 English(EN) · Jingyuan Wang, Richong Zhang, Zhijie Nie, Mingxin Li, Yanzhao Zhang ·

    DEPT:文档嵌入保留调优,用于统一查询扩展与检索

    arXiv:2608.17632v1 Announce Type: cross Abstract: Large language models (LLMs) can both expand underspecified queries and encode text as dense representations, suggesting a unified model for query expansion and retrieval. Existing systems usually rely on prompted expansions, inde…

  3. arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Yanzhao Zhang ·

    DEPT:文档嵌入保留调优,用于统一查询扩展和检索

    Large language models (LLMs) can both expand underspecified queries and encode text as dense representations, suggesting a unified model for query expansion and retrieval. Existing systems usually rely on prompted expansions, independently trained modules, or staged optimization,…

  4. arXiv cs.CL TIER_1 English(EN) · Chunran Zhang ·

    稠密扩展,稀疏锚定:用于混合检索的通道不对称查询扩展

    arXiv:2608.15851v1 Announce Type: cross Abstract: LLM-based query expansion improves retrieval by generating document-like passages. In hybrid retrieval, however, most evaluations fuse fixed top-$L$ dense and sparse rankings. Because the cutoff controls both which cross-channel c…

  5. arXiv cs.AI TIER_1 English(EN) · Zirui Song, Yuye Zhu, Yang Yang ·

    稀疏检索机制下的静态剪枝:哪些可迁移、哪些会失效、哪些仍有帮助

    arXiv:2608.16309v1 Announce Type: cross Abstract: Static pruning is widely used to accelerate sparse neural retrieval, yet existing studies each validate their conclusions within a single custom pipeline, leaving it unclear which findings transfer to modern engines with different…

  6. arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Yang Yang ·

    稀疏检索模型中的静态剪枝:哪些可迁移,哪些会失效,哪些仍有帮助

    Static pruning is widely used to accelerate sparse neural retrieval, yet existing studies each validate their conclusions within a single custom pipeline, leaving it unclear which findings transfer to modern engines with different index organizations and dynamic pruning mechanism…

  7. arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Chunran Zhang ·

    稠密扩展,稀疏锚定:用于混合检索的通道不对称查询扩展

    LLM-based query expansion improves retrieval by generating document-like passages. In hybrid retrieval, however, most evaluations fuse fixed top-$L$ dense and sparse rankings. Because the cutoff controls both which cross-channel contributions enter fusion and how much of each ran…