提出无需训练的统一令牌压缩框架,显著降低视觉变换器计算量。
Token Transforming: A Unified and Training-Free Token Compression Framework for Vision Transformer Acceleration
- 将令牌压缩统一为矩阵变换,支持多种方法融合
- 减少40%计算量,DeiT-S加速1.5倍仅损失0.1%准确率
- 适用于分割、检测等密集任务,无需重训练
视觉变换器在各类视觉任务中广泛应用,但其高昂的计算成本引发对动态令牌压缩的广泛关注。现有方法多聚焦于令牌剪枝或合并,仅压缩部分令牌,导致信息大量丢失,需依赖后训练恢复性能。本文重新思考令牌缩减,将其统一为显式的令牌矩阵变换形式,所有现有方法均可视为该框架下的特例。进一步提出多对多的令牌变换框架,作为现有方法的泛化形式,最大限度保留信息,实现无需训练的加速。大量实验验证了该框架的有效性:在减少40% FLOPs的同时,DeiT-S推理速度提升1.5倍,仅损失0.1%精度。方法还拓展至分割、目标检测、深度估计及语言建模等密集预测任务,均表现出显著性能提升,提供更优的计算-性能权衡与推理加速效果。
原文摘要 · Abstract (English)
Vision transformers have been widely explored in various vision tasks. Due to heavy computational cost, much interest has aroused for compressing vision transformer dynamically in the aspect of tokens. Current methods mainly pay attention to token pruning or merging to reduce token numbers, in which tokens are compressed exclusively, causing great information loss and therefore post-training is inevitably required to recover the performance. In this paper, we rethink token reduction and unify the process as an explicit form of token matrix transformation, in which all existing methods are constructing special forms of matrices within the framework. Furthermore, we propose a many-to-many Token Transforming framework that serves as a generalization of all existing methods and reserves the most information, even enabling training-free acceleration. We conduct extensive experiments to validate our framework. Specifically, we reduce 40% FLOPs and accelerate DeiT-S by $\times$1.5 with marginal 0.1% accuracy drop. Furthermore, we extend the method to dense prediction tasks including segmentation, object detection, depth estimation, and language model generation. Results demonstrate that the proposed method consistently achieves substantial improvements, offering a better computation-performance trade-off, impressive budget reduction and inference acceleration.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。