Pith. sign in

REVIEW 4 cited by

CP-ViT: Cascade Vision Transformer Pruning via Progressive Sparsity Prediction

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 2203.04570 v1 pith:SBLE6QW5 submitted 2022-03-09 cs.CV cs.AI

classification cs.CVcs.AI
keywords accuracycp-vitpruningmodelspatchessparsityvisioncascade
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Vision transformer (ViT) has achieved competitive accuracy on a variety of computer vision applications, but its computational cost impedes the deployment on resource-limited mobile devices. We explore the sparsity in ViT and observe that informative patches and heads are sufficient for accurate image recognition. In this paper, we propose a cascade pruning framework named CP-ViT by predicting sparsity in ViT models progressively and dynamically to reduce computational redundancy while minimizing the accuracy loss. Specifically, we define the cumulative score to reserve the informative patches and heads across the ViT model for better accuracy. We also propose the dynamic pruning ratio adjustment technique based on layer-aware attention range. CP-ViT has great general applicability for practical deployment, which can be applied to a wide range of ViT models and can achieve superior accuracy with or without fine-tuning. Extensive experiments on ImageNet, CIFAR-10, and CIFAR-100 with various pre-trained models have demonstrated the effectiveness and efficiency of CP-ViT. By progressively pruning 50\% patches, our CP-ViT method reduces over 40\% FLOPs while maintaining accuracy loss within 1\%.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Segment This Thing: Foveated Tokenization for Efficient Point-Prompted Segmentation

    cs.CV 2025-06 conditional novelty 7.0 of 10

    A point-prompted segmentation model gains efficiency by foveated tokenization, cutting tokens from 4096 to 172 while staying competitive on mIoU benchmarks.

  2. Optimal Brain Connection: Towards Efficient Structural Pruning

    cs.CV 2025-08 conditional novelty 6.0 of 10

    Jacobian Criterion with block-diagonal gradient products and Equivalent Pruning autoencoders improve pruned model accuracy.

  3. Training-free Token Reduction for Vision Mamba

    cs.CV 2025-07 conditional novelty 6.0 of 10

    MTR uses Mamba's timescale parameter Δ as a token importance score to merge unimportant tokens, giving training-free inference speedups with small accuracy loss.

  4. MixFrag: Fragility-Guided Mixed-Precision Post-Training Quantization for Vision Transformers

    cs.CV 2026-07 conditional novelty 4.5 of 10

    KL-isolation fragility plus MCKP bit allocation yields mixed-precision ViT PTQ that lags recent ImageNet PTQ but reports large COCO AP gains at MP3/MP3.

Pith tools