Scaling Laws in the Tiny Regime: How Small Models Change Their Mistakes
Not on the map. Why?
Abstract (arXiv)
Neural scaling laws describe how model performance improves as a power law with size, but existing work focuses on models above 100M parameters. The sub-20M regime -- where TinyML and edge AI operate -- remains unexamined. We train 90 models (22K--19.8M parameters) across two architectures (plain ConvNet, MobileNetV2) on CIFAR-100, varying width while holding depth and training fixed. Both follow approximate power laws in error rate: α = 0.156 ± 0.002 (ScaleCNN) and α = 0.106 ± 0.001 (MobileNetV2) across five seeds. Since prior work fit cross-entropy loss rather than error rate, direct exponent comparison is approximate; with that caveat, these are 1.4--2x steeper than α ≈ 0.076 for large language models. The power law does not hold uniformly: local exponents decay with scale, and MobileNetV2 saturates at 19.8M parameters (αlocal = 0.006). Error structure also changes. Jaccard overlap between error sets of the smallest and largest ScaleCNN is only 0.35 (25 seed pairs, ± 0.004) -- compression changes which inputs are misclassified, not merely how many. Small models concentrate capacity on easy classes (Gini: 0.26 at 22K vs. 0.09 at 4.7M) while abandoning the hardest (bottom-5 accuracy: 10% vs. 53%). Counter to expectation, the smallest models are best calibrated (ECE = 0.013 vs. peak 0.110 at mid-size). Aggregate accuracy is therefore misleading for edge deployment; validation must happen at the target model size.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 29 references that are in the map. First posted on arXiv 7 Mar 2026.
Builds on
25 of 29 references.
References · 25
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2022Emergent Abilities of Large Language Modelscited by 2,483
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2021Scaling Vision Transformerscited by 993
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
13 more
- 2017Deep Learning Scaling is Predictable, Empiricallycited by 556
- 2023Are Emergent Abilities of Large Language Models a Mirage?cited by 515
- 2021Explaining Neural Scaling Lawscited by 353
- 2020MCUNet: Tiny Deep Learning on IoT Devicescited by 269
- 2022Unified Scaling Laws for Routed Language Modelscited by 249
- 2019A Constructive Prediction of the Generalization Error Across Scalescited by 202
- 2020Characterising Bias in Compressed Modelscited by 162
- 2022On-Device Training Under 256KB Memorycited by 158
- 2022Revisiting Neural Scaling Laws in Language and Visioncited by 129
- 2021MLPerf Tiny Benchmarkcited by 118
- 2022Broken Neural Scaling Lawscited by 102
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2021Differentiable Network Pruning for Microcontrollerscited by 15
Built on by
Not cited yet.