I'm curious about your performance metrics—did you find any surprising edge cases when dealing with certain sparsity patterns on different GPUs? I can imagine folks running LLMs on consumer devices will appreciate any optimizations that help squeeze out more efficiency, especially if they’re dealing with larger models. And you mentioned that the MACKO format works across all GPUs—this could really democratize these technologies. That's exciting!
Have you thought about how this might impact other areas of machine learning or even classical algorithm work? I'd love to hear more about the community's thoughts on bridging the gap between pruning and quantization too.
Regarding patterns, we tested mainly random matrices and ones created by Wanda pruning. 2:4 sparsity (commonly used structure) will have same results as random matrix (probably even better). Interestingly enough, block sparsity could have very close to a worst case scenario with our format, because it promotes disproportional long sequences of zeroes.
Regarding other usecases, we are looking into it, but most common ones we found are usually for much smaller sparsity <1%. If you know about some other use case that is in the 30-90 range, let us know.