Skip to content
Open access

Joint MLP and Token Pruning for Personalizing Vision Transformers

Aug 2026 · Big Data and Cognitive Computing · Vol 10, pp. 265 · 0 citations · 35 references

TL;DR

This paper proposes a class-aware joint pruning framework for ViTs, which collaboratively compresses the model from two orthogonal dimensions: MLP neurons and visual tokens, and proposes a Class-Guided Token Selection method, which dynamically selects patch tokens that are semantically highly relevant to the target classes during inference in a zero-shot manner.

Abstract

ViTs have achieved excellent performance in image recognition tasks, but their large parameter counts and high computational complexity limit their deployment on resource-constrained devices. Most existing ViT pruning methods adopt class-agnostic pruning strategies, which fail to distinguish the diverse structural requirements of different target classes. As a result, they are prone to removing critical features, leading to class-wise accuracy imbalance in practical deployment. To address this issue, this paper proposes a class-aware joint pruning framework for ViTs, which collaboratively compresses the model from two orthogonal dimensions: MLP neurons and visual tokens. Specifically, (1) based on first-order Taylor expansion, we quantify the contribution of each MLP neuron to the target classes and adaptively prune redundant neurons to achieve structured compression, followed by lightweight fine-tuning on the target class subset; (2) we propose a Class-Guided Token Selection (CGTS) method, which constructs class prototype vectors using a few support samples of the target classes and then dynamically selects patch tokens that are semantically highly relevant to the target classes during inference in a zero-shot manner, requiring no additional training or fine-tuning. The two modules complement each other, achieving dual compression from the parameter dimension and the inference data dimension. Experiments on CIFAR-100 and TinyImageNet datasets using DeiT-Tiny/Small models demonstrate that, compared with state-of-the-art pruning methods, our method reduces GMACs on target class subsets by up to 48%, improves inference speed by nearly 50%, and requires only 0.8 KB of additional storage overhead per subset, ultimately achieving a superior trade-off among accuracy, computational efficiency, and storage overhead.

Read PDF

Similar papers

#artificial intelligence Preprint Oct 2026

Task-Aware Joint Pruning and Distillation for Efficient Audio Deepfake Detection

Advances in speech synthesis have made deepfake speeches increasingly convincing, posing growing threats to security. While self-supervised learning (SSL) based detectors achieve state-of-the-art performance, their computational demands (typically 300M+ parameters) prevent deployment on resource-constrained devices. Ex...

Miao He, Peng Cheng, Zhong-Jie Ba et al. · 0 citations
Open access 2026

Threshold-Tuning Coordinate Attention for Binarized Neural Networks

—Binary Neural Networks (BNNs) are highly attractive for mobile and embedded vision due to their extremely low memory footprint and efficient bit-level convolutions. However, binarization often causes severe information loss and weakens the effectiveness of conventional attention modules designed for full-precision net...

Shao-Qing Wu, Hiroyuki Yamauchi · 0 citations
Preprint Aug 2026

Clustering and Token Denoising for Faster and More Robust VLMs

This study introduces ClustRS, a two-part, training-free algorithm for robust token pruning, demonstrating a simple yet powerful alternative to both score-only and diversity-only pruning rules, paving the way for compute-efficient and noise-resilient VLM deployment.

Baptiste Rossigneux, Inna Kucher, Vincent Lorrain et al. · 0 citations
Open access Sep 2026

A data efficient pyramid vision transformer for image classification

A novel data efficient pyramid vision transformer (DE-PVT), designed to train on limited datasets by utilizing a teacher-student approach and linear computational complexity relative to the number of patches, achieved through a linear spatial reduction mechanism is introduced.

Gazi Jannatul Ferdous, Medhi Hasan Chowdhury, Md. Azad Hossain et al. · 0 citations
Conference Aug 2026

Efficient Model Pruning via Selective Layer-wise Distillation with Dynamic CKA-based Weighting

Deploying deep convolutional neural networks in resource-constrained edge environments necessitates aggressive model compression. While iterative block-level pruning paired with multi-stage Knowledge Distillation (KD) is a common strategy, traditional KD approaches rigidly enforce static, uniform loss weightings, leadi...

Chi-Dieu Bui, Chien-Quang Le · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.