ReGATE: Learning Faster and Better with Fewer Tokens in MLLMs
This addresses efficiency challenges in MLLM training for researchers and practitioners, offering a novel method rather than an incremental improvement.
The paper tackles the high computational cost of training multimodal large language models (MLLMs) by proposing ReGATE, an adaptive token pruning method that accelerates training while maintaining or improving accuracy, achieving up to 2x faster training with only 35% of tokens and reducing total token count by over 41%.
The computational cost of training multimodal large language models (MLLMs) rapidly increases with the number of tokens involved. Existing efficiency methods primarily target inference and rely on token reduction or merging, offering limited benefit during training. In this paper, we propose ReGATE (Reference$-$Guided Adaptive Token Elision), an adaptive token pruning method for accelerating MLLM training. Specifically, ReGATE adopts a teacher-student framework in which the MLLM being trained serves as the student, and a frozen reference large language model (LLM) acts as the teacher. The teacher computes per-token reference losses, which are combined with an exponential moving average (EMA) of the student's own difficulty scores. This adaptive difficulty-based scoring enables the selective processing of crucial tokens while bypassing less informative ones in the forward pass, significantly reducing computational overhead. Experiments demonstrate that ReGATE, when applied to VideoLLaMA2, matches the peak accuracy of standard training on MVBench up to 2$\times$ faster, using only 35% of the tokens. With additional training, it even surpasses the baseline on several multimodal benchmarks, all while reducing the total token count by over 41%. Code and models will be released soon.