Research map / Architectures and efficiency / Pruning and efficient tuning
Data-Efficient Structured Pruning via Submodular Optimization
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
- “Learning-Compression” Algorithms for Neural Net Pruning (CVPR 2018 · similarity 0.91)
- BMRS: Bayesian Model Reduction for Structured Pruning (NeurIPS 2024 · similarity 0.90)
- Pruning from Scratch (AAAI 2020 · similarity 0.90)
- Targeted Low-rank Refinement: Enhancing Sparse Language Models with Precision (ICML 2025 · similarity 0.89)
- Sparsest Models Elude Pruning: An Exposé of Pruning’s Current Capabilities (ICML 2024 · 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.