Research map / Architectures and efficiency / Pruning and efficient tuning
SlideSparse: Fast and Flexible (2N-2):2N Structured Sparsity
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- DuoGPT: Training-free Dual Sparsity through Activation-aware Pruning in LLMs (NeurIPS 2025 · similarity 0.88)
- SpeedLoader: An I/O efficient scheme for heterogeneous and distributed LLM operation (NeurIPS 2024 · similarity 0.86)
- Accelerating Transformer Pre-training with 2:4 Sparsity (ICML 2024 · similarity 0.86)
- Sparse maximal update parameterization: A holistic approach to sparse training dynamics (NeurIPS 2024 · similarity 0.86)
- TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks (NeurIPS 2025 · similarity 0.85)
- S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training (NeurIPS 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.