HypTM: Efficient Vision Transformers With Hyperbolic Token Merging

IF 10.8 1区 工程技术 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC
Xiaoyu Chen;Xin Zhang;Weiying Xie;Jitao Ma;Yunsong Li;Leyuan Fang
{"title":"HypTM: Efficient Vision Transformers With Hyperbolic Token Merging","authors":"Xiaoyu Chen;Xin Zhang;Weiying Xie;Jitao Ma;Yunsong Li;Leyuan Fang","doi":"10.1109/TCSVT.2026.3709249","DOIUrl":null,"url":null,"abstract":"Vision Transformers (ViTs) have shown tremendous potential in various computer vision applications attribute to the attention mechanism, which comes at the expense of increased computational costs. Therefore, token compression methods such as pruning and merging are proposed to facilitate the deployment of ViTs on resource-constrained devices. However, existing approaches assess tokens in Euclidean space, neglecting their complex geometric and hierarchical relationships. In this paper, we propose a novel Hyperbolic Token Merging (HypTM) method by exploring the intrinsic properties of images in hyperbolic space. Our HypTM is inspired by the insight that the contribution of distinct tokens to the overall image varies across the hierarchy. To this end, we develop a hyperbolic-driven token assessment algorithm that dynamically adjusts token significance according to hierarchical structure. Additionally, we design a hierarchy enhancement merging strategy to advance correlations among tokens within the same hierarchy. Without any retraining, our HypTM achieves notable improvements over the state-of-the-arts (SOTAs), while maintaining comparable FLOPs (floating point operations). For the DeiT-S model on ImageNet dataset, we achieve a 41.3% reduction in FLOPs with only a 0.48% decrease in Top-1 accuracy, which is even 0.09% higher than that of the meticulously fine-tuned comparison approach.","PeriodicalId":13082,"journal":{"name":"IEEE Transactions on Circuits and Systems for Video Technology","volume":"36 10","pages":"14786-14799"},"PeriodicalIF":10.8000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Circuits and Systems for Video Technology","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/11592494/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/1 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Vision Transformers (ViTs) have shown tremendous potential in various computer vision applications attribute to the attention mechanism, which comes at the expense of increased computational costs. Therefore, token compression methods such as pruning and merging are proposed to facilitate the deployment of ViTs on resource-constrained devices. However, existing approaches assess tokens in Euclidean space, neglecting their complex geometric and hierarchical relationships. In this paper, we propose a novel Hyperbolic Token Merging (HypTM) method by exploring the intrinsic properties of images in hyperbolic space. Our HypTM is inspired by the insight that the contribution of distinct tokens to the overall image varies across the hierarchy. To this end, we develop a hyperbolic-driven token assessment algorithm that dynamically adjusts token significance according to hierarchical structure. Additionally, we design a hierarchy enhancement merging strategy to advance correlations among tokens within the same hierarchy. Without any retraining, our HypTM achieves notable improvements over the state-of-the-arts (SOTAs), while maintaining comparable FLOPs (floating point operations). For the DeiT-S model on ImageNet dataset, we achieve a 41.3% reduction in FLOPs with only a 0.48% decrease in Top-1 accuracy, which is even 0.09% higher than that of the meticulously fine-tuned comparison approach.
HypTM:具有双曲令牌合并的高效视觉变压器
视觉变压器(Vision transformer, ViTs)由于其注意机制,在各种计算机视觉应用中显示出巨大的潜力,但代价是计算成本的增加。因此,提出了诸如修剪和合并等令牌压缩方法,以方便在资源受限的设备上部署vit。然而,现有的方法在欧几里得空间中评估符号,忽略了它们复杂的几何和层次关系。本文通过探索双曲空间中图像的固有性质,提出了一种新的双曲令牌合并(HypTM)方法。我们的HypTM的灵感来自于这样一种见解,即不同的令牌对整个图像的贡献在不同的层次结构中是不同的。为此,我们开发了一种双曲驱动的令牌评估算法,该算法根据层次结构动态调整令牌重要性。此外,我们设计了一个层次结构增强合并策略,以提高同一层次结构中令牌之间的相关性。在没有任何再培训的情况下,我们的HypTM比最先进的(sota)有了显著的改进,同时保持了相当的FLOPs(浮点运算)。对于ImageNet数据集上的DeiT-S模型,我们实现了FLOPs降低41.3%,Top-1精度仅降低0.48%,甚至比精心微调的比较方法高0.09%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
13.80
自引率
27.40%
发文量
660
审稿时长
5 months
期刊介绍: The IEEE Transactions on Circuits and Systems for Video Technology (TCSVT) is dedicated to covering all aspects of video technologies from a circuits and systems perspective. We encourage submissions of general, theoretical, and application-oriented papers related to image and video acquisition, representation, presentation, and display. Additionally, we welcome contributions in areas such as processing, filtering, and transforms; analysis and synthesis; learning and understanding; compression, transmission, communication, and networking; as well as storage, retrieval, indexing, and search. Furthermore, papers focusing on hardware and software design and implementation are highly valued. Join us in advancing the field of video technology through innovative research and insights.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书