arXiv:2509.14165cs.CVcs.AI2025-09被引 1

提出STEP框架,让视觉Transformer在高分辨率下高效运行

Where Do Tokens Go? Understanding Pruning Behaviors in STEP at High Resolutions

  • 用轻量CNN动态合并小块为大块,减少输入令牌数
  • 在1024×1024图像上实现4倍计算量降低,精度损失≤2%
  • 适合需要高分辨率语义分割的实时应用

视觉变换器(ViTs)在语义分割中表现卓越,但计算与内存开销大。为此,我们提出STEP(SuperToken和早期剪枝)框架,结合动态块合并与令牌剪枝以提升效率。核心是dCTS——一个轻量级CNN策略网络,支持灵活生成超块。编码器引入早期退出机制,移除高置信度的超令牌,降低计算负担。我们在高分辨率语义分割基准上评估,当仅使用dCTS时,令牌数量相比标准16×16像素分块减少2.5倍,采用ViT-Large时计算成本下降2.6倍,吞吐量提升3.4倍。完整STEP框架进一步实现计算复杂度降低4倍、推理速度提升1.7倍,最大精度损失不超过2.0%。通过该配置,最多40%的令牌可被提前预测并终止处理,无需进入最终编码层。

原文摘要 · Abstract (English)

Vision Transformers (ViTs) achieve state-of-the-art performance in semantic segmentation but are hindered by high computational and memory costs. To address this, we propose STEP (SuperToken and Early-Pruning), a hybrid token-reduction framework that combines dynamic patch merging and token pruning to enhance efficiency without significantly compromising accuracy. At the core of STEP is dCTS, a lightweight CNN-based policy network that enables flexible merging into superpatches. Encoder blocks integrate also early-exits to remove high-confident supertokens, lowering computational load. We evaluate our method on high-resolution semantic segmentation benchmarks, including images up to 1024 x 1024, and show that when dCTS is applied alone, the token count can be reduced by a factor of 2.5 compared to the standard 16 x 16 pixel patching scheme. This yields a 2.6x reduction in computational cost and a 3.4x increase in throughput when using ViT-Large as the backbone. Applying the full STEP framework further improves efficiency, reaching up to a 4x reduction in computational complexity and a 1.7x gain in inference speed, with a maximum accuracy drop of no more than 2.0%. With the proposed STEP configurations, up to 40% of tokens can be confidently predicted and halted before reaching the final encoder layer.

视觉Transformer令牌剪枝高分辨率分割

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。