Event ·Official first-hand

arXiv 论文将 OpenAI 矩阵乘法分析推广到矩形乘积,证明 α≥1/2

一篇 arXiv 论文将 OpenAI 近期矩阵乘法结果所用的共享腿熵不等式推广到矩形乘积,证明当 k≥1/2 时 ω(1,k,1)≤1+k+1/(4k),并给出 ω(1,1/2,1)=2 与对偶指数 α≥1/2。作者保留了双腿对称性与各扇区方向,通过幂化辅助剖面的渐近斜率得出谱约束 b≤4a(1-a),再经张量谱对偶得到矩形曲线。应用方面,Zwick 的有向无权图全对最短路径算法运行时间降至 O(n^2.5),结合 Alman 与 Vassilevska Williams 的 (min,+)-乘积改进可进一步达到 O(n^2.4999)。

Current read

有人把 OpenAI 那篇矩阵乘法论文的方法推到矩形情形,证明 α≥1/2,最短路径算法直接降到 O(n^2.5),做理论算法的可以看看证明思路。

11 sources51° AI heatLast updated 2026/10/7 17:46:39

Evidence

11 sources
Primary sourcearXiv: OpenAI
View source
Related source 1rohanpaul_ai
View source
Related source 2kimmonismus
View source
Related source 4Thomas Wolf
View source
Related source 8Greg Brockman
View source
Related source 9Tech in Asia
View source
Related source 10Bindu Reddy
View 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.