arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.15388cs.CVcs.AIcs.CL

LLaVA-PruMerge: 适应性令牌减少用于高效的大多模态模型

LLaVA-PruMerge: Adaptive Token Reduction for Efficient Large Multimodal Models

UCF(佛罗里达大学);UW-Madison(威斯康星大学麦迪逊分校);USC(南加州大学);UIC(伊利诺伊大学香槟分校)

Yuzhang Shang, Mu Cai, Bingxin Xu, Yong Jae Lee, Yan Yan

AI总结:

LLaVA-PruMerge通过自适应视觉令牌减少策略,显著降低视觉令牌数量而不影响性能,适用于高效的大多模态模型。

摘要:

大型多模态模型(LMMs)通过连接视觉编码器和大型语言模型展示了显著的视觉推理能力。LMMs通常输入固定且大量的视觉令牌,例如CLIP视觉编码器的倒数第二层特征作为前缀内容。最近的LMMs加入了更多复杂的视觉输入,如高分辨率图像和视频,这进一步显著增加了视觉令牌的数量。然而,由于Transformer架构的固有设计,这些模型的计算成本会随着输入令牌数量的增加而呈二次增长。为了解决这个问题,我们探索了一种令牌减少机制,该机制能够识别视觉令牌之间的显著空间冗余。为此,我们提出了PruMerge,一种新颖的自适应视觉令牌减少策略,能够显著减少视觉令牌的数量,而不会影响LMMs的性能。具体来说,为了衡量每个令牌的重要性,我们利用了视觉编码器中观察到的稀疏性,其特点是类别令牌与视觉令牌之间的注意力分数分布稀疏。这种稀疏性使我们能够动态选择最关键的视觉令牌以保留。随后,我们根据它们的关键相似性对选定(未修剪)的令牌进行聚类,并将它们与未修剪的令牌合并,从而有效地补充和增强其信息内容。实证研究表明,当应用于LLaVA-1.5时,我们的方法平均可以将视觉令牌压缩14倍,并且在各种视觉问答和推理任务中实现可比的性能。代码和检查点位于https://llava-prumerge.github.io/。

英文摘要:

Large Multimodal Models (LMMs) have shown significant visual reasoning capabilities by connecting a visual encoder and a large language model. LMMs typically take in a fixed and large amount of visual tokens, such as the penultimate layer features in the CLIP visual encoder, as the prefix content. Recent LMMs incorporate more complex visual inputs, such as high-resolution images and videos, which further increases the number of visual tokens significantly. However, due to the inherent design of the Transformer architecture, the computational costs of these models tend to increase quadratically with the number of input tokens. To tackle this problem, we explore a token reduction mechanism that identifies significant spatial redundancy among visual tokens. In response, we propose PruMerge, a novel adaptive visual token reduction strategy that significantly reduces the number of visual tokens without compromising the performance of LMMs. Specifically, to metric the importance of each token, we exploit the sparsity observed in the visual encoder, characterized by the sparse distribution of attention scores between the class token and visual tokens. This sparsity enables us to dynamically select the most crucial visual tokens to retain. Subsequently, we cluster the selected (unpruned) tokens based on their key similarity and merge them with the unpruned tokens, effectively supplementing and enhancing their informational content. Empirically, when applied to LLaVA-1.5, our approach can compress the visual tokens by 14 times on average, and achieve comparable performance across diverse visual question-answering and reasoning tasks. Code and checkpoints are at https://llava-prumerge.github.io/.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑