Research map / Architectures and efficiency / Pruning and efficient tuning
DominoSearch: Find layer-wise fine-grained N:M sparse schemes from dense neural networks
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
- The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training (ICLR 2022 · similarity 0.91)
- Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch (ICLR 2021 · similarity 0.91)
- Computation and Memory-Efficient Model Compression with Gradient Reweighting (NeurIPS 2025 · similarity 0.91)
- Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks (NeurIPS 2021 · similarity 0.91)
- Sparsest Models Elude Pruning: An Exposé of Pruning’s Current Capabilities (ICML 2024 · similarity 0.90)
- Targeted Low-rank Refinement: Enhancing Sparse Language Models with Precision (ICML 2025 · 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.