Matryoshka Model Learning for Improved Elastic Student Models
Not on the map. Why?
Abstract (arXiv)
Industry-grade ML models are carefully designed to meet rapidly evolving serving constraints, which requires significant resources for model development. In this paper, we propose MatTA, a framework for training multiple accurate Student models using a novel Teacher-TA-Student recipe. TA models are larger versions of the Student models with higher capacity, and thus allow Student models to better relate to the Teacher model and also bring in more domain-specific expertise. Furthermore, multiple accurate Student models can be extracted from the TA model. Therefore, despite only one training run, our methodology provides multiple servable options to trade off accuracy for lower serving cost. We demonstrate the proposed method, MatTA, on proprietary datasets and models. Its practical efficacy is underscored by live A/B tests within a production ML system, demonstrating 20% improvement on a key metric. We also demonstrate our method on GPT-2 Medium, a public model, and achieve relative improvements of over 24% on SAT Math and over 10% on the LAMBADA benchmark.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 32 of its 57 references that are in the map. First posted on arXiv 29 May 2025.
Builds on
32 of 57 references.
References · 32
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2014FitNets: Hints for Thin Deep Netscited by 1,653
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
20 more
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
- 2023Scaling Vision Transformers to 22 Billion Parameterscited by 694
- 2017Deep Mutual Learningcited by 628
- 2017BranchyNet: Fast Inference via Early Exiting from Deep Neural Networkscited by 596
- 2019Be Your Own Teacher: Improve the Performance of Convolutional Neural Networks via Self Distillationcited by 497
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2018Large scale distributed neural network training through online distillationcited by 146
- 2017Soft Weight-Sharing for Neural Network Compressioncited by 99
- 2022Less is More: Task-aware Layer-wise Distillation for Language Model Compressioncited by 93
- 2023MatFormer: Nested Transformer for Elastic Inferencecited by 85
- 2023A Distributed Data-Parallel PyTorch Implementation of the Distributed Shampoo Optimizer for Training Neural Networks At-Scalecited by 77
- 2019End-to-End Speech Translation with Knowledge Distillationcited by 58
- 2023Does Graph Distillation See Like Vision Dataset Counterpart?cited by 45
- 2023Three Pillars improving Vision Foundation Model Distillation for Lidarcited by 44
- 2021One Teacher is Enough? Pre-trained Language Model Distillation from Multiple Teacherscited by 40
- 2022On the Factory Floor: ML Engineering for Industrial-Scale Ads Recommendation Modelscited by 34
- 2020Incorporating User Micro-behaviors and Item Knowledge into Multi-task Learning for Session-based Recommendationcited by 18
- 2024Train Once, Deploy Anywhere: Matryoshka Representation Learning for Multimodal Recommendationcited by 9
- 2018Self-Referenced Deep Learningcited by 7
- 2025Scalable Machine Learning Training Infrastructure for Online Ads Recommendation and Auction Scoring Modeling at Googlecited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.