Looping Back to Move Forward: Recursive Transformers for Efficient and Flexible Large Multimodal Models
Ruihan Xu, Yuting Gao, Lan Wang, Jianing Li, Weihao Chen, Qingpei Guo, Ming Yang, Shiliang Zhang
TL;DR
This work addresses the underutilization of large multimodal models by reusing existing parameters through recursive refinement. It introduces RecursiveVLM, a recursive Transformer with a Recursive Connector that aligns cross-step features via multi-layer, modality-specific fusion, and a Monotonic Recursion Loss that enforces non-decreasing performance with recursion depth. The key contributions are the RMSNorm-based feature normalization, modality-specific projection with a learnable residual scale, and a training objective that guarantees stable improvements across steps, enabling deployment-adaptive inference. Empirically, RecursiveVLM outperforms standard Transformers and vanilla recursive baselines across eight multimodal benchmarks, with notable gains at shallow recursion and continued improvements as recursion deepens, plus evidence suggesting recursion can mitigate hallucinations. The approach offers a practical path toward efficient, adaptable, and trustworthy multimodal reasoning without increasing model size.
Abstract
Large Multimodal Models (LMMs) have achieved remarkable success in vision-language tasks, yet their vast parameter counts are often underutilized during both training and inference. In this work, we embrace the idea of looping back to move forward: reusing model parameters through recursive refinement to extract stronger multimodal representations without increasing model size. We propose RecursiveVLM, a recursive Transformer architecture tailored for LMMs. Two key innovations enable effective looping: (i) a Recursive Connector that aligns features across recursion steps by fusing intermediate-layer hidden states and applying modality-specific projections, respecting the distinct statistical structures of vision and language tokens; (ii) a Monotonic Recursion Loss that supervises every step and guarantees performance improves monotonically with recursion depth. This design transforms recursion into an on-demand refinement mechanism: delivering strong results with few loops on resource-constrained devices and progressively improving outputs when more computation resources are available. Experiments show consistent gains of +3% over standard Transformers and +7% over vanilla recursive baselines, demonstrating that strategic looping is a powerful path toward efficient, deployment-adaptive LMMs.
