Event ·Official first-hand

OpenAI 证明矩阵乘法指数上界 9/4 的解读论文

arXiv 上一篇新论文对 OpenAI 的矩阵乘法指数上界 9/4 结果给出完整阐述，该上界对任意数域成立。作者使用 Coppersmith-Winograd 提出的张量值的分数对称化变体，替代原证明中的谱点（张量特征）。论文证明了这个值的幂在部分直和上的超可加性不等式，其中各加项共享一个张量因子并占据另两个维度上的独立子空间。结合 OpenAI 证明中多项式乘法张量的退化，该不等式最终推出 9/4 的上界。

Current read

OpenAI 把矩阵乘法复杂度上界压到 9/4 了，这篇论文把证明拆开讲清楚，适合想看懂数学细节的人。

7 sources52° AI heatLast updated 2026/11/6 16:56:52

Evidence

7 sources

Primary sourcearXiv: OpenAI

2026/11/6 16:56:52View source

Related source 1Stanford AI Lab

2026/11/4 21:05:05View source

Related source 2IT之家

2026/11/4 22:51:59View source

Related source 3rohanpaul_ai

2026/11/5 01:06:09View source

Related source 4kimmonismus

2026/11/5 09:14:00View source

Related source 5DAIR.AI

2026/11/5 13:41:04View source

Related source 6小互

2026/11/8 05:36:25View source

Conflict check

Dedup data only shows that these sources discuss the same event, not that they agree. There is no structured supporting or refuting evidence yet, so no conflict is inferred automatically.

Open the story