arXiv:2412.06263cs.CV2024-12中稿 · ICLR被引 13

通过优化图像编码器减少输入令牌,实现多模态模型端到端加速。

iLLaVA: An Image is Worth Fewer Than 1/3 Input Tokens in Large Multimodal Models

  • 在图像编码阶段合并令牌,同时保留关键信息
  • 吞吐量提升2倍,预填充时间减少4倍
  • 适合追求高效多模态推理的开发者

近期方法通过利用视觉输入的内在冗余,在加速大视觉语言模型(LVLM)方面取得进展。然而,现有方法大多仅关注在大型语言模型(LLM)阶段前或内部减少图像令牌以降低计算成本,忽略了图像编码器这一主要瓶颈——其本身需要大量计算。由于图像编码器是向LLM提供输入令牌的主要来源,因此在编码阶段减少视觉冗余不仅能加快编码器速度,还能显著减轻后续LLM负担。为此,我们研究如何联合优化图像编码器、LLM及其他组件,实现全面加速。为避免令牌减少导致性能下降,提出一种新型令牌合并策略,回收本被丢弃令牌中的有用信息。所提出的iLLaVA方法在图像与视频理解任务中均表现一致提升,实现最高2倍吞吐量增长和4倍预填充时间减少。值得注意的是,iLLaVA使更大模型(如InternVL-2.5 26B)在准确率与效率上均超越较小模型(如InternVL-2.5 8B)。与最先进的令牌剪枝与合并技术相比,本方法优势明显。最后,我们提供了iLLaVA合并步骤的详细可视化,深入揭示各组件对高效计算的贡献。

原文摘要 · Abstract (English)

Recent methods have made notable progress in accelerating Large Vision-Language Models (LVLMs) by exploiting the inherent redundancy in visual inputs. Most existing approaches, however, focus narrowly on reducing image tokens before or within the Large Language Model (LLM) stage to lower computational cost. This overlooks other major bottlenecks, particularly the image encoder, which itself requires substantial computation. As a result, these methods fall short of achieving true end-to-end acceleration. Importantly, the image encoder is the primary contributor of input tokens to the LLM. Thus, reducing visual redundancy at the encoder stage not only speeds up the encoder itself but also significantly lightens the workload for the subsequent LLM. Motivated by this, we investigate how to jointly optimize the image encoder and the LLM along with other LVLM components for comprehensive acceleration. To mitigate the risk of performance degradation from token reduction, we propose a novel token merging strategy that recycles useful information from otherwise discarded tokens. Our approach, iLLaVA, delivers consistent improvements across both image and video understanding tasks, achieving up to a 2 times throughput boost and a 4 times reduction in prefilling time. Notably, iLLaVA enables a larger model (e.g., InternVL-2.5 26B) to surpass a smaller counterpart (e.g., InternVL-2.5 8B) in both accuracy and efficiency. Extensive comparisons with state-of-the-art token pruning and merging techniques demonstrate the clear superiority of our method. Finally, we provide detailed visualizations for the merging steps of iLLaVA , offering deeper insights into how different LVLM components contribute to efficient computation.

多模态模型加速视觉语言令牌合并

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