Pith. sign in

REVIEW 1 cited by

Multi-Dimensional Pruning: Joint Channel, Layer and Block Pruning with Latency Constraint

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.12079 v1 pith:DWKG5T5M submitted 2024-06-17 cs.CV cs.AIcs.LG

classification cs.CVcs.AIcs.LG
keywords pruninglatencyachievingaggressivechannelmulti-dimensionaloptimalratio
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

As we push the boundaries of performance in various vision tasks, the models grow in size correspondingly. To keep up with this growth, we need very aggressive pruning techniques for efficient inference and deployment on edge devices. Existing pruning approaches are limited to channel pruning and struggle with aggressive parameter reductions. In this paper, we propose a novel multi-dimensional pruning framework that jointly optimizes pruning across channels, layers, and blocks while adhering to latency constraints. We develop a latency modeling technique that accurately captures model-wide latency variations during pruning, which is crucial for achieving an optimal latency-accuracy trade-offs at high pruning ratio. We reformulate pruning as a Mixed-Integer Nonlinear Program (MINLP) to efficiently determine the optimal pruned structure with only a single pass. Our extensive results demonstrate substantial improvements over previous methods, particularly at large pruning ratios. In classification, our method significantly outperforms prior art HALP with a Top-1 accuracy of 70.0(v.s. 68.6) and an FPS of 5262 im/s(v.s. 4101 im/s). In 3D object detection, we establish a new state-of-the-art by pruning StreamPETR at a 45% pruning ratio, achieving higher FPS (37.3 vs. 31.7) and mAP (0.451 vs. 0.449) than the dense baseline.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Advancing Weight and Channel Sparsification with Enhanced Saliency

    cs.LG 2025-02 conditional novelty 7.0 of 10

    An iterative exploitation-exploration loop lets simple saliency scores such as weight magnitude beat more complex sparse-training and pruning baselines on ImageNet and other benchmarks.

Pith tools