pages/index.md

Repro - SlideSparse: Fast and Flexible (2N-2):2N Structured Sparsity

Pages

Page
Claim 1: Coverage theorem
Claim 2: Theoretical speedup bound
Claim 3: A100 Qwen2.5-7B prefill
Claim 4: Kernel performance
Claim 5: Qwen3 reasoning accuracy
Claim 6: Decode performance
Conclusion