HackerPapers

arXiv:2212.01175cs.SC

Flip Graphs for Matrix Multiplication

Manuel Kauers, Jakob Moosbauer

Abstract

We introduce a new method for discovering matrix multiplication schemes based on random walks in a certain graph, which we call the flip graph. Using this method, we were able to reduce the number of multiplications for the matrix formats (4, 4, 5) and (5, 5, 5), both in characteristic two and for arbitrary ground fields.

arXiv comments
Journal reference
DOI
Subjects
cs.SCSymbolic Computation

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from May 2023 to May 2025.

Comments linking this paper, per year.

Discussed in comments2 threads

    • One of the researchers quoted in Nature link here... in the past, when DeepMind published "AlphaTensor" [1][2] in October 2022, it took a single day (!!), see [3], for improvements to the AlphaTensor-based scheme to be discovered. This was then a few months later generalized…

      friederrrView on HNParent context

    • For context, this video was published yesterday. It concerning matrix multiplication news from the end of last year. It links to an article from last fall, at https://www.quantamagazine.org/ai-reveals-new-possibilities-... , saying: > Last month, a team at the artificial…

      eesmithView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.