New paper pushes (min,+)-matrix multiplication exponent to 2.9964, beating Anthropic-linked breakthrough
thegautamkamath · x · 2026-10-17
Theorist Gautam Kamath highlights a new paper by Barna Saha and Christopher Ye (arXiv:2610.20297) giving a deterministic Õ(N^2.9964) algorithm for (min,+)-matrix multiplication, improving the recent O(N^2.9995) breakthrough by Alman and Vassilevska Williams, with a simpler modular subcubic APSP algorithm. He also notes private skepticism that some recent 'simplification' papers are substantively simpler, while praising authors working on less glamorous problems.
Related event: New Algorithm Lowers (min,+) Matrix Multiplication Exponent to 2.9964(2 posts)→
More from Research
- Yann LeCun and NYU team propose AdaJEPA to adapt world models when the world changes — mengyer · 2026-10-17
- Harvard mathematician open-sources attempt to get Claude to construct Yang-Mills — lvwerra · 2026-10-17
- Model tweaks barely move MMLU but easily break generative tasks — aryaman2020 · 2026-10-17
- sika-agent: open RL environment trains AI agents to catch MoMo scams in Twi and English — emeka_boris · 2026-10-17
- PKU & Samsung: slow model coaching lifts fast agent's live game score from 13.51 to 24.19 — rohanpaul_ai · 2026-10-17
- CoPE adds one forecasting loss to GRPO for 2x sample efficiency in agent RL — youjiaxuan · 2026-10-17