mlsanityData to 14 Oct 2026

Do Dynamic Routers Need Memory? HeRo: History-Aware Routing for Efficient LLM Inference

arXiv 2609.08189 ↗First posted 8 Sep 2026cs.AI cs.CLcited by 0

On the map: Efficient LLM inference and serving → Serving systems and request scheduling

Abstract (arXiv)

Dynamic layer routing reduces the inference cost of Large Language Models (LLMs) by learning to skip layers for individual tokens. Existing methods, however, treat each routing decision as a local operation conditioned solely on the current hidden state which is a formulation that overlooks the sequential, path-dependent nature of routing across depth: earlier decisions shape the representations seen by downstream routers, and the layer-usage objective couples all decisions jointly. We propose History-Aware Routing (HeRo), a dynamic routing framework that resolves this mismatch by introducing a router memory mechanism to maintain an explicit routing state across model depth. The memory is constructed via linear attention, incrementally aggregating preceding routing scores and their induced residual updates into a compact history representation. At each routed layer, the router conditions jointly on this accumulated state and the current hidden representation to select the executed branch. Instantiated for token-wise FFN routing, HeRo trains only lightweight routers and adapters on a frozen backbone, requiring no modification to pretrained parameters. Across Llama 3.1-8B, Llama 2-7B, and Llama 2-13B, HeRo consistently achieves the highest aggregate performance retention among ten baselines. On Llama 3.1-8B, it bypasses 26.87% of model parameters while achieving 100.24% of dense model performance across seven benchmarks, and retains 97.01% while bypassing 38.82% of model parameters under a tighter computation budget. Ablation studies confirm that removing routing history consistently degrades performance, most notably on multistep reasoning and code generation, validating that explicit routing memory enables more accurate and adaptive dynamic routing than solely conditioning on hidden state.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Serving systems and request scheduling, one of 12 directions in Efficient LLM inference and serving. Builds on 22 of its 30 references that are in the map. First posted on arXiv 8 Sep 2026.

Builds on

22 of 30 references.

References · 22

  1. 2017Attention Is All You Needcited by 60,361
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  4. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  7. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  8. 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 1,053
  9. 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 383
  10. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
  11. 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
  12. 2020FastBERT: a Self-distilling BERT with Adaptive Inference Timecited by 226
10 more
  1. 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 126
  2. 2024Transformers represent belief state geometry in their residual streamcited by 77
  3. 2025Adaptive Layer-skipping in Pre-trained LLMscited by 27
  4. 2023Cross-Layer Retrospective Retrieving via Layer Attentioncited by 22
  5. 2024Layerwise Recurrent Router for Mixture-of-Expertscited by 21
  6. 2024Accelerating Inference in Large Language Models with a Unified Layer Skipping Strategycited by 17
  7. 2025Dr.LLM: Dynamic Layer Routing in LLMscited by 12
  8. 2025SkipGPT: Dynamic Layer Pruning Reinvented with Token Awareness and Module Decouplingcited by 11
  9. 2025What Layers When: Learning to Skip Compute in LLMs with Residual Gatescited by 6
  10. 2025You Do Not Fully Utilize Transformer's Representation Capacitycited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers
  2. 2025Universal Model Routing for Efficient LLM Inference
  3. 2026LLM Router: Rethinking Routing with Prefill Activations
  4. 2024Performance Characterization of Expert Router for Scalable LLM Inference
  5. 202698× Faster LLM Routing Without a Dedicated GPU: Flash Attention, Prompt Compression, and Near-Streaming for the vLLM Semantic Router
  6. 2024RouteLLM: Learning to Route LLMs with Preference Data
  7. 2026Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey
  8. 2025Lookahead Routing for Large Language Models