Super Tiny Language Models
Not on the map. Why?
Abstract (arXiv)
The rapid advancement of large language models (LLMs) has led to significant improvements in natural language processing but also poses challenges due to their high computational and energy demands. This paper introduces a series of research efforts focused on Super Tiny Language Models (STLMs), which aim to deliver high performance with significantly reduced parameter counts. We explore innovative techniques such as byte-level tokenization with a pooling mechanism, weight tying, and efficient training strategies. These methods aim to significantly reduce reduce the parameter count compared to traditional models -- in future works, we aim to build on these in a way that maintains and improves upon the performance of base transformer models. This series of papers will explore into various subproblems, including tokenizer-free models, self-play based training, and alternative training objectives. We will target models with 10M, 50M, and 100M parameters. Our ultimate goal is to make high-performance language models more accessible and practical for a wide range of applications.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 38 of its 51 references that are in the map. First posted on arXiv 23 May 2024.
Builds on
38 of 51 references.
References · 38
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
26 more
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2023Qwen Technical Reportcited by 3,273
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2024Phi-3 Technical Report: A Highly Capable Language Model Locally on Your Phonecited by 1,883
- 2024Mixtral of Expertscited by 1,785
- 2020GLU Variants Improve Transformercited by 1,724
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2024TinyLlama: An Open-Source Small Language Modelcited by 604
- 2021Carbon Emissions and Large Neural Network Trainingcited by 561
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
- 2019BLiMP: The Benchmark of Linguistic Minimal Pairs for Englishcited by 553
- 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 425
- 2024ShortGPT: Layers in Large Language Models are More Redundant Than You Expectcited by 369
- 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
- 2016Using the Output Embedding to Improve Language Modelscited by 266
- 2023Think before you speak: Training Language Models With Pause Tokenscited by 254
- 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
- 2023The Impact of Depth on Compositional Generalization in Transformer Language Modelscited by 37
- 2024MobiLlama: Towards Accurate and Lightweight Fully Transparent GPTcited by 34
- 2019Tensorized Embedding Layers for Efficient Model Compressioncited by 27
- 2024Autonomous Data Selection with Zero-shot Generative Classifiers for Mathematical Textscited by 26
- 2023Dropout Reduces Underfittingcited by 21
Built on by
Citing papers per year: 2024: 2; 2025: 4; 2026: 1.
7 papers.
- 2024Internal Consistency and Self-Feedback in Large Language Models: A Surveycited by 49
- 2024A Hitchhiker's Guide to Scaling Law Estimationcited by 23
- 2025Parameterized Synthetic Text Generation with SimpleStoriescited by 9
- 2025StochasTok: Improving Fine-Grained Subword Understanding in LLMscited by 6
- 2025All is Not Lost: LLM Recovery without Checkpointscited by 1
- 2026Stochasticity in Tokenisation Improves Robustnesscited by 1
- 2025Toward Agentic Environments: GenAI and the Convergence of AI, Sustainability, and Human-Centric Spacescited by 0
- 2026Stochasticity in Tokenisation Improves Robustness17 Apr 2026
- 2025Toward Agentic Environments: GenAI and the Convergence of AI, Sustainability, and Human-Centric Spaces15 Dec 2025
- 2025All is Not Lost: LLM Recovery without Checkpoints18 Jun 2025
- 2025StochasTok: Improving Fine-Grained Subword Understanding in LLMs2 Jun 2025
- 2025Parameterized Synthetic Text Generation with SimpleStories12 Apr 2025
- 2024A Hitchhiker's Guide to Scaling Law Estimation15 Oct 2024
- 2024Internal Consistency and Self-Feedback in Large Language Models: A Survey19 Jul 2024