LGAIJun 12

Squeeze-Release: Iterative Pruning with Exact Structural Minimization

arXiv:2606.14346v110.3h-index: 20
Predicted impact top 38% in LG · last 90 daysOriginality Highly original
AI Analysis

This work addresses the deployment inefficiency of unstructured pruning by enabling exact structural compression, producing smaller models without accuracy loss.

Squeeze-Release iteratively prunes and structurally minimizes neural networks, converting masked weights into smaller dense networks, achieving 39x compression on fully-connected models and 14.8x on ConvNeXt-Tiny with comparable accuracy.

Unstructured pruning produces sparse weight tensors, but the standard implementation keeps tensor shapes unchanged so the deployed model is no smaller than before pruning. We present an exact structural rewrite, which we call minimization, that converts a masked network into a smaller dense network with the same forward function up to floating-point rounding. The Squeeze-Release cycle iterates pruning and minimization with an intermediate release step that re-enables the exact-zero positions inside the compacted tensors as small calibrated noise, turning otherwise wasted capacity back into trainable parameters. Successive cycles use that capacity to find structural redundancy a single pass cannot reach. We additionally introduce CompensatedLayerNorm, a function-preserving replacement for LayerNorm that extends minimization to channel reduction across LayerNorm-equipped residual streams. Squeeze-Release compresses the deployable network to 39x smaller than the unpruned model on a fully-connected model network and 14.8x smaller on modern CNN (ConvNeXt-Tiny), at comparable accuracy. In addition we prove that the rewrite can be extended to transformer architectures.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes