PulseAugur
中
实时 21:31:40
English(EN) Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval

线性记忆容量取决于检索:Top-1 为 $n\log n$,列表式为 $n$

研究人员分析了线性联想记忆的容量限制,发现检索标准显著影响可存储的联想数量。对于 Top-1 检索(信号必须优于所有其他信号),记忆大小的规模为 $d^2 \asymp n \log n$。在考虑列表式检索(允许正确目标成为一组强候选者中的一员)时,容量呈二次方缩放 $d^2 \asymp n$。这项工作引入了尾部平均裕度(TAM)标准来形式化列表式检索,并开发了其性能的渐近理论。 AI

影响 为记忆系统的容量限制提供了理论见解,这对于设计未来人工智能架构具有参考意义。

排序理由 这是一篇详细介绍联想记忆容量理论发现的研究论文。

在 arXiv stat.ML 阅读 →

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

线性记忆容量取决于检索:Top-1 为 $n\log n$,列表式为 $n$

本文如何被排名

Signal score
0 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Research
这是一篇详细介绍联想记忆容量理论发现的研究论文。
Source corroboration
2 independent sources
Multiple independent publishers reporting the same story raises confidence that it's real and newsworthy.
Topics
paper, other
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
200 days old
Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

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

报道来源 [2]

  1. arXiv cs.LG TIER_1 English(EN) · Nicholas Barnfield, Juno Kim, Eshaan Nichani, Jason D. Lee, Yue M. Lu ·

    线性联想记忆中的尖锐容量阈值:从“赢者通吃”到列表式检索

    arXiv:2605.05189v1 Announce Type: cross Abstract: How many key-value associations can a $d\times d$ linear memory store? We show that the answer depends not only on the $d^2$ degrees of freedom in the memory matrix, but also on the retrieval criterion. In an isotropic Gaussian mo…

  2. arXiv stat.ML TIER_1 English(EN) · Yue M. Lu ·

    线性联想记忆中的尖锐容量阈值:从“赢者通吃”到列表式检索

    How many key-value associations can a $d\times d$ linear memory store? We show that the answer depends not only on the $d^2$ degrees of freedom in the memory matrix, but also on the retrieval criterion. In an isotropic Gaussian model for the stored pairs, we show that top-1 retri…