pith. sign in

arxiv: 1710.01878 · v2 · pith:F5ZCUHUGnew · submitted 2017-10-05 · 📊 stat.ML · cs.LG

To prune, or not to prune: exploring the efficacy of pruning for model compression

classification 📊 stat.ML cs.LG
keywords modelmodelsaccuracycompressiondeepnumberprunepruning
0
0 comments X
read the original abstract

Model pruning seeks to induce sparsity in a deep neural network's various connection matrices, thereby reducing the number of nonzero-valued parameters in the model. Recent reports (Han et al., 2015; Narang et al., 2017) prune deep networks at the cost of only a marginal loss in accuracy and achieve a sizable reduction in model size. This hints at the possibility that the baseline models in these experiments are perhaps severely over-parameterized at the outset and a viable alternative for model compression might be to simply reduce the number of hidden units while maintaining the model's dense connection structure, exposing a similar trade-off in model size and accuracy. We investigate these two distinct paths for model compression within the context of energy-efficient inference in resource-constrained environments and propose a new gradual pruning technique that is simple and straightforward to apply across a variety of models/datasets with minimal tuning and can be seamlessly incorporated within the training process. We compare the accuracy of large, but pruned models (large-sparse) and their smaller, but dense (small-dense) counterparts with identical memory footprint. Across a broad range of neural network architectures (deep CNNs, stacked LSTM, and seq2seq LSTM models), we find large-sparse models to consistently outperform small-dense models and achieve up to 10x reduction in number of non-zero parameters with minimal loss in accuracy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Prune, Update and Trim: Robust Structured Pruning for Large Language Models

    cs.LG 2026-05 unverdicted novelty 5.0

    Putri is a structured pruning technique for LLMs that compensates for pruning errors via weight updates and sequential processing while pruning at the attention-head level to reach state-of-the-art results at extreme ...

  2. Engineering Resource-constrained Software Systems with DNN Components: a Concept-based Pruning Approach

    cs.SE 2026-04 unverdicted novelty 5.0

    A concept-based pruning method for DNNs guided by interpretable concepts and system requirements produces smaller, computationally efficient models that maintain effectiveness on image classification tasks.

  3. Beyond Sunk Costs: Boosting LLM Pre-training Efficiency via Orthogonal Growth of Mixture-of-Experts

    cs.LG 2025-10 unverdicted novelty 5.0

    Orthogonal growth recycles pre-trained MoE checkpoints via layer copying and noisy expert duplication, delivering 10.6% higher accuracy than training from scratch with equivalent extra compute.

  4. Meta-Learning Guided Pruning for Few-Shot Plant Pathology on Edge Devices

    cs.CV 2026-01 unverdicted novelty 4.0

    DACIS-guided PMP pipeline prunes plant pathology models by 78% while retaining 92.3% accuracy and achieving 7 FPS on Raspberry Pi 4 using few-shot meta-learning.

  5. Exploring Vision Neural Network Pruning via Screening Methodology

    cs.LG 2025-02 unverdicted novelty 4.0

    A unified F-statistic screening and weighted evaluation method prunes both unstructured and structured parameters in FNNs and CNNs, claiming order-of-magnitude size reduction with competitive accuracy on vision datasets.

  6. A Survey on Foundation Models for Personalized Federated Intelligence

    cs.AI 2025-05 unverdicted novelty 3.0

    The survey introduces personalized federated intelligence (PFI) as a framework integrating federated learning and foundation models to support privacy-aware personalization of AI models.