UPSCALE: Unconstrained Channel Pruning

Alvin Wan, Hanxiang Hao, Kaushik Patnaik, Yueyang Xu, Omer Hadad +3 more
2/12/2026

No official code found. Best implementation: apple/ml-upscale (74 stars, last commit 2023-07-14). 1 more below.

Abstract

As neural networks grow in size and complexity, inference speeds decline. To combat this, one of the most effective compression techniques -- channel pruning -- removes channels from weights. However, for multi-branch segments of a model, channel removal can introduce inference-time memory copies. In turn, these copies increase inference latency -- so much so that the pruned model can be slower than the unpruned model. As a workaround, pruners conventionally constrain certain channels to be pruned together. This fully eliminates memory copies but, as we show, significantly impairs accuracy. We now have a dilemma: Remove constraints but increase latency, or add constraints and impair accuracy. In response, our insight is to reorder channels at export time, (1) reducing latency by reducing memory copies and (2) improving accuracy by removing constraints. Using this insight, we design a generic algorithm UPSCALE to prune models with any pruning pattern. By removing constraints from existing pruners, we improve ImageNet accuracy for post-training pruned models by 2.1 points on average -- benefiting DenseNet (+16.9), EfficientNetV2 (+7.9), and ResNet (+6.2). Furthermore, by reordering channels, UPSCALE improves inference speeds by up to 2x over a baseline export.

View on arXivView PDF

Code Implementations(2)

apple/ml-upscaleCommunity100%

Export utility for unconstrained channel pruned models

7411Python, Jupyter NotebookJul 12, 20233 years agoNOASSERTION
deep-learningexportmachine-learningpruning
MIT

Analysis and reproduction of UPSCALE: Unconstrained Channel Pruning (ICML 2023)

00Python, Jupyter NotebookApr 3, 20266 months agoMIT

Similar Papers

Cite this paper

@article{wan2026upscale,
  title  = {UPSCALE: Unconstrained Channel Pruning},
  author = {Alvin Wan and Hanxiang Hao and Kaushik Patnaik and Yueyang Xu and Omer Hadad and David Guera and Zhile Ren and Qi Shan},
  year   = {2026},
  eprint = {2307.08771},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/pdf/2307.08771},
  journal = {ICML 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.08771.svg)](https://codeofpaper.com/paper/2307.08771)

Discussion