Faster Matrix Multiplication via Asymmetric Hashing · HackerPapers discussions

Faster Matrix Multiplication via Asymmetric Hashing — mentioned by barfbagginus

Sat, 16 Mar 2024 02:51:20 GMT

I made two really bad misunderstandings which I completely own. I can't seem to edit it, so please let this be my refutation and explanation of my own mistake. First misunderstanding: I assumed this was a new large matrix multiplication algorithm building on the hype from last week or so where we saw this paper: https://arxiv.org/abs/2210.10173 It is not an algorithm, but a hardware design - a systolic array using roughly half of the silicon area of a baseline design. 2. Assuming that we were talking about an algorithm, I then further assumed that it reduce an algorithm's multiplications by…

Paper and discussion history. A mention is not an endorsement.

Faster Matrix Multiplication via Asymmetric Hashing — mentioned by anchovy_

Wed, 14 Jun 2023 15:37:28 GMT

>However, an O(n^3) algorithm will always loose out to an O(n^2*log(n)) algorithm, when the input gets big enough. Sure, this might be the case from a theoretical point of view (as per definition) but this completely disregards the hidden constants that come to light when actually implementing an algorithm. There's a reason why for instance a state-of-the-art matrix multiplication algorithm [0] can be completely useless in practice: The input data will never become large enough in order to amortize the introduced overhead. [0] https://arxiv.org/abs/2210.10173

Paper and discussion history. A mention is not an endorsement.