Literature review of Matryoshka Language Model Suites

Ideas behind Matryoshka LM Suites and what it adds

The papers this builds on

Godey and Artzi (2026) (hereafter GA26) introduce Matryoshka LM Suites, which combines nested models, knowledge distillation, and speculative decoding. Its new contribution is how these ideas are integrated to train a family of models.

The nesting principle draws on earlier work. Kusupati et al. (2022) trained embeddings whose initial coordinates already form useful representations, allowing shorter vectors to be used when resources are limited. Building on this idea, Devvrit et al. (2024) applied the nesting principle to Transformer feed-forward networks in MatFormer. Smaller versions use subsets of neurons and share their weights with larger versions. These choices can then be combined across layers to obtain additional sizes without retraining.

Within this line of work, GA26 changes how the models are nested. Larger models extend smaller ones with additional, wider Transformer layers. Its 500M model has 24 layers of width 1024; the 1.5B model adds 10 layers of width 2304; and the 3B model adds another five of width 4352. Smaller models therefore use fewer, narrower layers and smaller attention caches. In the original MatFormer formulation, attention dimensions and depth remain fixed, so reducing the feed-forward width does not shrink the KV cache.

MatFormer has also been adopted at larger scales. Gemma 3n (2025) used MatFormer, nesting a model with 2B effective parameters inside one with 4B (Gemma Team, 2025). GA26’s trained comparison with MatFormer is limited to the 200M scale, while Appendix E compares theoretical resource costs at a 3B size. A direct comparison of model quality at larger scales remains an interesting question.

To train the nested models, GA26 also draws on knowledge distillation. Buciluǎ et al. (2006) demonstrated that small models could learn to imitate larger ensembles. Building on this approach, Hinton et al. (2015) described combining supervision from correct labels with the teacher’s predicted probabilities. GA26 uses this loss form for next-token prediction. Its contribution here is the integration, where one shared training forward pass supplies the predictions needed for the largest model to teach all smaller models.

This agreement between models also benefits speculative decoding, which lets a small model propose several tokens that a larger model checks. This can accelerate generation while preserving the larger model’s output distribution (Leviathan et al., 2023). Earlier work improved this process by training the small model to imitate the large one, i.e., by draft–verifier alignment through distillation Zhou et al. (2024). GA26 combines these benefits within its model suite, since distillation encourages agreement during training, while shared layers reduce duplicated work during inference.

The fields and concepts it connects to

The use of smaller models within a larger network also connects conceptually to the lottery ticket hypothesis Frankle and Carbin (2019). They showed that a large trained network contains much smaller sub-networks that, trained alone from the same starting weights, reach similar accuracy. Finding them, however,requires training the large network first and then pruning it. The resulting sub-networks are scattered sets of weights. MatFormer and GA26 design the smaller networks in advance. The whole family is then trained together from scratch, and each size can be extracted as a complete model.

Another related approach is elastic compression, which turns an already trained LLM into several smaller versions through additional training (Cai et al., 2024). GA26 instead trains the different networks together from scratch, aiming to reduce the cost of creating new versions.

Finally, LoRA (Hu et al., 2022) adapts a pretrained model by freezing its original weights and learning small, low-rank updates. Its connection to GA26 is the broader goal of reducing training costs through parameter reuse. However, LoRA’s updates still require the base model’s weights, whereas GA26 jointly trains complete models of different sizes with shared weights. LoRA is therefore a related efficiency technique.

References

  1. Matryoshka Language Model Suites
    Nathan Godey and Yoav Artzi
    2026
  2. Matryoshka Representation Learning
    Aditya Kusupati, Gantavya Bhatt, Aniket Rege, and 8 more authors
    In Advances in Neural Information Processing Systems (NeurIPS), 2022
  3. MatFormer: Nested Transformer for Elastic Inference
    Devvrit, Sneha Kudugunta, Aditya Kusupati, and 8 more authors
    In Advances in Neural Information Processing Systems (NeurIPS), 2024
  4. Gemma 3n
    Gemma Team
    2025
  5. Model Compression
    Cristian BuciluÇŽ, Rich Caruana, and Alexandru Niculescu-Mizil
    In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006
  6. Distilling the Knowledge in a Neural Network
    Geoffrey Hinton, Oriol Vinyals, and Jeff Dean
    2015
  7. Fast Inference from Transformers via Speculative Decoding
    Yaniv Leviathan, Matan Kalman, and Yossi Matias
    In International Conference on Machine Learning (ICML), 2023
  8. DistillSpec: Improving Speculative Decoding via Knowledge Distillation
    Yongchao Zhou, Kaifeng Lyu, Ankit Singh Rawat, and 5 more authors
    In International Conference on Learning Representations (ICLR), 2024
  9. The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks
    Jonathan Frankle and Michael Carbin
    In International Conference on Learning Representations (ICLR), 2019
  10. Flextron: Many-in-One Flexible Large Language Model
    Ruisi Cai, Saurav Muralidharan, Greg Heinrich, and 4 more authors
    In International Conference on Machine Learning (ICML), 2024
  11. LoRA: Low-Rank Adaptation of Large Language Models
    Edward J. Hu, Yelong Shen, Phillip Wallis, and 5 more authors
    In International Conference on Learning Representations (ICLR), 2022



Enjoy Reading This Article?

Here are some more articles you might like to read next:

  • What Makes a Chain of Thought Easy to Learn?
  • The points that matter about Matryoshka suites.
  • Rewriting the abstract
  • Reimplementing a speculative decoding throughput test, shown in Figure 5a
  • A better Figure 2