mlsanityData to 7 Oct 2026

Balcony: A Lightweight Approach to Dynamic Inference of Generative Language Models

arXiv 2503.05005 ↗First posted 6 Mar 2025cs.CL cs.AI cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Deploying large language models (LLMs) in real-world applications is often hindered by strict computational and latency constraints. While dynamic inference offers the flexibility to adjust model behavior based on varying resource budgets, existing methods are frequently limited by hardware inefficiencies or performance degradation. In this paper, we introduce Balcony, a simple yet highly effective framework for depth-based dynamic inference. By freezing the pretrained LLM and inserting additional transformer layers at selected exit points, Balcony maintains the full model's performance while enabling real-time adaptation to different computational budgets. These additional layers are trained using a straightforward self-distillation loss, aligning the sub-model outputs with those of the full model. This approach requires significantly fewer training tokens and tunable parameters, drastically reducing computational costs compared to prior methods. When applied to the LLaMA3-8B model, using only 0.2% of the original pretraining data, Balcony achieves minimal performance degradation while enabling significant speedups. Remarkably, we show that Balcony outperforms state-of-the-art methods such as Flextron and Layerskip as well as other leading compression techniques on multiple models and at various scales, across a variety of benchmarks.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 26 of its 38 references that are in the map. First posted on arXiv 6 Mar 2025.

Builds on

26 of 38 references.

References · 26

  1. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  2. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
  6. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  7. 2023Qwen Technical Reportcited by 3,273
  8. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  9. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  10. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  11. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  12. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,615
14 more
  1. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 975
  2. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
  3. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
  4. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
  5. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 322
  6. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
  7. 2018Slimmable Neural Networkscited by 301
  8. 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 246
  9. 2019Universally Slimmable Networks and Improved Training Techniquescited by 219
  10. 2024LaCo: Large Language Model Pruning via Layer Collapsecited by 124
  11. 2021Dynamic Slimmable Networkcited by 83
  12. 2023MatFormer: Nested Transformer for Elastic Inferencecited by 79
  13. 2023Sorted LLaMA: Unlocking the Potential of Intermediate Layers of Large Language Models for Dynamic Inferencecited by 7
  14. 2024NutePrune: Efficient Progressive Pruning with Numerous Teachers for Large Language Modelscited by 7

Built on by

Cited by year (2026 to 7 Oct)

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

4 papers.