Predicting Neural Network Accuracy from Weights
Thomas Unterthiner, Daniel Keysers, Sylvain Gelly, Olivier Bousquet, Ilya Tolstikhin
TL;DR
This work formalizes the goal of predicting a neural network's accuracy using only its trained weights, and builds a large publicly available dataset of 120k CNNs (Small CNN Zoo) to study weight-accuracy mappings. It shows that weight-based predictors, particularly gradient-boosted trees using per-layer weight statistics, can rank models by performance with R^2 often exceeding 0.98 and can transfer ranking across unseen datasets and larger architectures. The findings provide insights into training dynamics and offer a potential pathway for data-free model selection or early-stopping, while highlighting open questions about interpretable rules and stronger inductive biases. The authors also release the dataset to spur further research into weight-aware understanding of deep learning performance and generalization across domains.
Abstract
We show experimentally that the accuracy of a trained neural network can be predicted surprisingly well by looking only at its weights, without evaluating it on input data. We motivate this task and introduce a formal setting for it. Even when using simple statistics of the weights, the predictors are able to rank neural networks by their performance with very high accuracy (R2 score more than 0.98). Furthermore, the predictors are able to rank networks trained on different, unobserved datasets and with different architectures. We release a collection of 120k convolutional neural networks trained on four different datasets to encourage further research in this area, with the goal of understanding network training and performance better.
