<story><title>Show HN: Matrix Multiplication with Half the Multiplications</title><url>https://github.com/trevorpogue/algebraic-nnhw</url></story><parent_chain><item><author>halflings</author><text>This looks pretty cool! What&amp;#x27;s the catch? e.g. why isn&amp;#x27;t this already implemented in accelerators, is it really just a forgotten algorithm, or this has some implications on the cost of building the accelerator or else?</text></item></parent_chain><comment><author>lupire</author><text>It&amp;#x27;s not just a software algorithm. It&amp;#x27;s a hardware architecture optimization. To benefit, you have to build hardware that matches the dimensions of the algorithm. That&amp;#x27;s an expensive commitment.</text></comment>
<story><title>Show HN: Matrix Multiplication with Half the Multiplications</title><url>https://github.com/trevorpogue/algebraic-nnhw</url></story><parent_chain><item><author>halflings</author><text>This looks pretty cool! What&amp;#x27;s the catch? e.g. why isn&amp;#x27;t this already implemented in accelerators, is it really just a forgotten algorithm, or this has some implications on the cost of building the accelerator or else?</text></item></parent_chain><comment><author>pclmulqdq</author><text>There are a lot of matrix multiplication algorithms out there with a lot of pluses and minuses. It&amp;#x27;s always a balance of accuracy, runtime, and scaling.  This one probably has bad accuracy in floating point.</text></comment>