English(EN) Scaling Laws For Data-Constrained Dense Retrieval

新数据约束下密集检索模型缩放定律揭晓

作者 PulseAugur 编辑部 · [1 个来源] · 2026-11-03 14:33

研究人员开发了一种新的缩放定律，用于描述在数据约束微调条件下密集检索模型的性能。该定律基于最小可实现评估损失（MAEL），能够准确预测模型大小和独特的微调数据如何影响检索性能。研究发现，学习率的选择会影响优化过程，但不会影响最终的MAEL，并且MAEL遵循参数和独特样本的乘法幂律。研究还表明，增加预训练模型的大小比增加独特的领域内数据在降低MAEL方面更具计算效率。 AI

影响为数据受限场景下密集检索模型的优化提供了一个框架，有望改进搜索和信息检索系统。

排序理由学术论文，详细介绍了AI模型的新缩放定律。[lever_c_demoted from research: ic=1 ai=1.0]

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

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

本文如何被排名

Signal score: 3 / 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, model release; 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: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

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

报道来源 [1]

arXiv cs.IR (Information Retrieval) TIER_1 English(EN) · Jingtao Zhan · 2026-11-03 14:33

数据受限密集检索的规模法则

Dense retrieval models are typically obtained by fine-tuning pretrained language models on supervised retrieval data, where high-quality annotations or interaction logs are often limited and reused across many epochs. This data-constrained regime differs from the abundant-data se…

本文如何被排名

报道来源 [1]

数据受限密集检索的规模法则

相关实体

相关话题