mlsanityData to 7 Oct 2026

What Layers When: Learning to Skip Compute in LLMs with Residual Gates

arXiv 2510.13876 ↗First posted 13 Oct 2025cs.CL cs.AIcited by 6

On the map: Efficient LLM inference and serving → Early exit and edge inference

Abstract (arXiv)

We introduce GateSkip, a simple residual-stream gating mechanism that enables token-wise layer skipping in decoder-only LMs. Each Attention/MLP branch is equipped with a sigmoid-linear gate that condenses the branch's output before it re-enters the residual stream. During inference we rank tokens by the gate values and skip low-importance ones using a per-layer budget. While early-exit or router-based Mixture-of-Depths models are known to be unstable and need extensive retraining, our smooth, differentiable gates fine-tune stably on top of pretrained models. On long-form reasoning, we save up to 15% compute while retaining over 90% of baseline accuracy. For increasingly larger models, this tradeoff improves drastically. On instruction-tuned models we see accuracy gains at full compute and match baseline quality near 50% savings. The learned gates give insight into transformer information flow (e.g., BOS tokens act as anchors), and the method combines easily with quantization, pruning, and self-speculative decoding.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in Early exit and edge inference, one of 12 directions in Efficient LLM inference and serving. First posted on arXiv 13 Oct 2025.

Builds on

0 of 0 references.

No references here yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 5.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026A rigor-matched audit of periodic-step layer skipping for efficient llm inference: conflayers versus swift, with a supplemental analysis of trained routing alternatives
  2. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding
  3. 2026Compute Where it Counts: Self Optimizing Language Models
  4. 2026TIDE: Token-Informed Depth Execution for Per-Token Early Exit in LLM Inference
  5. 2026LayerRoute: Adaptive Layer-Skipping with LoRA-Preserved Quality for Efficient LLM Inference
  6. 2026Why Gated DeltaNet Survives 4-Bit Quantization: NVFP4 W4A4 for the Recurrent Half of a Hybrid 27B LLM
  7. 2026PARTREP: Learning What to Repeat for Decoder-only LLMs
  8. 2026Probe and Skip: Self-Predictive Token Skipping for Efficient Long-Context LLM Inference