Research map / Architectures and efficiency / Pruning and efficient tuning
Revisit Kernel Pruning with Lottery Regulated Grouped Convolutions
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
- One Less Reason for Filter Pruning: Gaining Free Adversarial Robustness with Structured Grouped Kernel Pruning (NeurIPS 2023 · similarity 0.92)
- Flexible Group Count Enables Hassle-Free Structured Pruning (CVPR 2025 · similarity 0.90)
- Pruning Filters for Efficient ConvNets (ICLR 2017 · similarity 0.88)
- Provable Filter Pruning for Efficient Neural Networks (ICLR 2020 · similarity 0.88)
- REPrune: Channel Pruning via Kernel Representative Selection (AAAI 2024 · similarity 0.88)
- SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization (NeurIPS 2024 · similarity 0.87)
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.