Router-Tuning: A Simple and Effective Approach for Enabling Dynamic-Depth in Transformers
Not on the map. Why?
Abstract (arXiv)
Traditional transformer models often allocate a fixed amount of computational resources to every input token, leading to inefficient and unnecessary computation. To address this, the Mixture of Depths (MoD) was introduced to dynamically adjust the computational depth by skipping less important layers. Despite its promise, current MoD approaches remain under-explored and face two main challenges: (1) high training costs due to the need to train the entire model along with the routers that determine which layers to skip, and (2) the risk of performance degradation when important layers are bypassed. In response to the first issue, we propose Router-Tuning, a method that fine-tunes only the router on a small dataset, drastically reducing the computational overhead associated with full model training. For the second challenge, we propose MindSkip, which deploys Attention with Dynamic Depths. This method preserves the model's performance while significantly enhancing computational and memory efficiency. Extensive experiments demonstrate that our approach delivers competitive results while dramatically improving the computation efficiency, e.g., 21% speedup and only a 0.2% performance drop. The code is released at https://github.com/CASE-Lab-UMD/Router-Tuning.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 29 of its 45 references that are in the map. First posted on arXiv 17 Oct 2024.
Builds on
29 of 45 references.
References · 29
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,224
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
17 more
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 867
- 2021Dynamic Neural Networks: A Surveycited by 408
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
- 2024OLMoE: Open Mixture-of-Experts Language Modelscited by 301
- 2024The Unreasonable Ineffectiveness of the Deeper Layerscited by 226
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Modelscited by 146
- 2024LLaMA Pro: Progressive LLaMA with Block Expansioncited by 101
- 2024Loki: Low-rank Keys for Efficient Sparse Attentioncited by 89
- 2024What Matters in Transformers? Not All Attention is Neededcited by 84
- 2023Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decodingcited by 80
- 2024DLO: Dynamic Layer Operation for Efficient Vertical Scaling of LLMscited by 10
- 2024Delving into Parameter-Efficient Fine-Tuning in Code Change Learning: An Empirical Studycited by 8
Built on by
Citing papers per year: 2025: 4; 2026: 6.
10 papers.
- 2025Adaptive Layer-skipping in Pre-trained LLMscited by 27
- 2025Dr.LLM: Dynamic Layer Routing in LLMscited by 12
- 2026Skip a Layer or Loop It? Learning Program-of-Layers in LLMscited by 9
- 2025Understanding and Harnessing Sparsity in Unified Multimodal Modelscited by 4
- 2026DirMoE: Dirichlet-routed Mixture of Expertscited by 1
- 2026Programs-of-Layers in LLMs through the Lens of Cortical Areascited by 1
- 2025LiteStage: Latency-aware Layer Skipping for Multi-stage Reasoningcited by 0
- 2026End-to-End Dynamic Sparsity for Resource-Adaptive LLM Inferencecited by 0
- 2026Dynamic Routing as a New Dimension for Test-time Versatility of LLMscited by 0
- 2026Task-Oriented Key-Layer KV Communication for Efficient Latent Multi-Agent Collaborationcited by 0
- 2026Dynamic Routing as a New Dimension for Test-time Versatility of LLMs3 Oct 2026
- 2026Programs-of-Layers in LLMs through the Lens of Cortical Areas25 Sep 2026
- 2026Task-Oriented Key-Layer KV Communication for Efficient Latent Multi-Agent Collaboration24 Sep 2026
- 2026End-to-End Dynamic Sparsity for Resource-Adaptive LLM Inference26 Jun 2026
- 2026Skip a Layer or Loop It? Learning Program-of-Layers in LLMs4 Jun 2026
- 2026DirMoE: Dirichlet-routed Mixture of Experts9 Feb 2026
- 2025Understanding and Harnessing Sparsity in Unified Multimodal Models2 Dec 2025
- 2025LiteStage: Latency-aware Layer Skipping for Multi-stage Reasoning16 Oct 2025
- 2025Dr.LLM: Dynamic Layer Routing in LLMs14 Oct 2025
- 2025Adaptive Layer-skipping in Pre-trained LLMs31 Mar 2025