动态金字塔网络让多模态大模型更高效,难题样本自动分配更多算力。
Dynamic Pyramid Network for Efficient Multimodal Large Language Model
- 构建分层压缩结构,浅层保留细粒度视觉信息。
- 在LLaVA上降低56%计算量,性能还提升0.74%。
- 适配高分辨率模型,适合追求效率与精度的部署场景。
多模态大语言模型(MLLM)在多种视觉语言任务中表现优异,但高昂的计算成本限制了其实际应用。现有方法通过压缩视觉特征来降低计算开销,但直接压缩会破坏视觉语义,尤其在复杂样本上。为此,本文提出一种动态金字塔网络(DPN),将MLLM设计为层级结构,随深度逐步压缩视觉特征,使浅层仍能保留细粒度信息。为进一步发挥潜力,提出动态池化专家(DPE),根据输入特征动态选择最优压缩率,使难样本获得更高计算资源,从而保持模型性能。在两个主流MLLM和十个基准测试上验证,DPN在LLaVA上可减少56%平均浮点运算量(FLOPs),并实现+0.74%性能提升。同时在高分辨率模型LLaVA-HR上也验证了良好的泛化能力。代码将开源于https://github.com/aihao2000/DPN-LLaVA。
原文摘要 · Abstract (English)
Multimodal large language models (MLLMs) have demonstrated impressive performance in various vision-language (VL) tasks, but their expensive computations still limit the real-world application. To address this issue, recent efforts aim to compress the visual features to save the computational costs of MLLMs. However, direct visual compression methods, e.g. efficient projectors, inevitably destroy the visual semantics in MLLM, especially in difficult samples. To overcome this shortcoming, we propose a novel dynamic pyramid network (DPN) for efficient MLLMs. Specifically, DPN formulates MLLM as a hierarchical structure where visual features are gradually compressed with increasing depth. In this case, even with a high compression ratio, fine-grained visual information can still be perceived in shallow layers. To maximize the benefit of DPN, we further propose an innovative Dynamic Pooling Experts (DPE) that can dynamically choose the optimal visual compression rate according to input features. With this design, harder samples will be assigned larger computations, thus preserving the model performance. To validate our approach, we conduct extensive experiments on two popular MLLMs and ten benchmarks. Experimental results show that DPN can save up to 56% average FLOPs on LLaVA while further achieving +0.74% performance gains. Besides, the generalization ability of DPN is also validated on the existing high-resolution MLLM called LLaVA-HR. The source code will be released at https://github.com/aihao2000/DPN-LLaVA.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。