用简单变换替换大模型冗余层,不训练也能提速降参
TOAST: Transformer Optimization using Adaptive and Simple Transformations
- 用线性或恒等映射替代完整Transformer块,无需重训练
- 在多个视觉模型上减少参数与计算,性能持平或提升
- 适合追求轻量化部署的开发者,尤其对大模型优化有帮助
基础模型在多任务上表现卓越,但其规模与计算开销引发可及性与可持续性担忧。现有高效方法常需额外微调,实用性受限。最新研究发现深度神经网络存在内部表征相似性,虽跨模型相似性已用于模型拼接与融合,但模型内冗余仍被忽视。本文提出TOAST框架,利用此类冗余,以轻量闭式映射(如线性变换或恒等函数)近似整个Transformer块,无需任何额外训练。在ViT、DINOv2、DeiT等主流预训练视觉模型及从MNIST到ImageNet-1k的数据集上,TOAST显著降低参数与计算量,同时保持甚至提升下游性能。结果表明,模型深度的大量部分可被简单函数替代,为高效基础模型提供了新视角。
原文摘要 · Abstract (English)
Foundation models achieve state-of-the-art performance across different tasks, but their size and computational demands raise concerns about accessibility and sustainability. Existing efficiency methods often require additional retraining or finetuning, limiting their practicality. Recent findings suggest that deep neural networks exhibit internal representation similarities. While such similarities across different models have been exploited for enabling techniques such as model stitching and merging, intra-network redundancy remains underexplored as a source for efficiency gains. In this paper, we introduce Transformer Optimization using Adaptive and Simple Transformations (TOAST), a framework that exploits these redundancies to approximate entire transformer blocks with lightweight closed-form mappings, such as linear transformations or even the identity function, without any additional training. Across state-of-the-art pretrained vision models (e.g., ViT, DINOv2, DeiT) and datasets ranging from MNIST to ImageNet-1k, TOAST reduces parameters and computation while preserving, and in some cases improving, downstream performance. These results show that large portions of transformer depth can be replaced by trivial functions, opening a new perspective on efficient foundation models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。