| > What is the Big O run time on this? The claim is they’re dropping half the multiplications, so it isn’t doing anything for Big O. > If you want to improve the project credibility please consider being honest and open about what is actually going on and giving some clear explanations and illustrations, The math explaining how to halve the number of multiplications in the paper (https://arxiv.org/abs/2311.12224) isn’t hard to understand. You only have to read formulas 2 (traditional matrix multiplication) and 3 to 6. I think it’s clear it does do what’s being advertised, halving the number of multiplications at the cost of lots of extra additions/subtractions. They then go on to better vectorize that algorithm. That, as is usual for that, gets looking messy soon. My main concern would be numerical stability. |