按年被提到
20262026 · 5 次2026
算法与数据结构›经典算法与数据结构·arXiv:2608.16884 · cs.DS

Improving the matrix multiplication exponent with modern optimization and AlphaEvolve

Emilien Dupont, Marvin Eisenberger, Borislav Kozlovskii, Abbas Mehrabian, Francisco J. R. Ruiz, Abigail See, Renfei Zhou, Josh Alman, Virginia Vassilevska Williams, Matej Balog · 2026
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 5 人首次 2026-08-18 · 最近 2026-10-16
5不同的人
2活跃月份
5讨论串
0被引(OpenAlex)
arXiv 摘要(候选层不写导读)

The current best bounds on the matrix multiplication exponent $ω$ are obtained through a refinement of the laser method called combination loss analysis (Duan et al., 2022; Williams et al., 2024; Alman et al., 2025). In this note, we address the optimization problem at the core of this approach and propose several improvements. First, we reformulate the optimization problem allowing us to solve it in a larger setting than was previously possible. Second, we leverage recent advances in machine learning to design a new optimization algorithm for this problem. Finally, we refine the resulting optimization algorithm with AlphaEvolve. Our combined approach yields an upper bound of $ω$ < 2.371177, improving the previous best bound of 2.371339.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论thomasahle · 2026-10

“Google AI improved the fast matrix-multiplication here: https://arxiv.org/abs/2608.16884 Most of what the labs are pursuing with "Recursive Self Improvement" is basically improving the underlying algorithms.”

Subquadratic 3SUM and Subcubic APSP原评论 ↗
被提交为 story · 4 次