Research map / Architectures and efficiency / Pruning and efficient tuning
Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks
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
- TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks (NeurIPS 2025 · similarity 0.92)
- Minimum Variance Unbiased N:M Sparsity for the Neural Gradients (ICLR 2023 · similarity 0.91)
- DominoSearch: Find layer-wise fine-grained N:M sparse schemes from dense neural networks (NeurIPS 2021 · similarity 0.91)
- Bi-directional Masks for Efficient N:M Sparse Training (ICML 2023 · similarity 0.91)
- BAME: Block-Aware Mask Evolution for Efficient N:M Sparse Training (ICML 2025 · similarity 0.89)
- SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization (NeurIPS 2024 · similarity 0.89)
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.