Blake Bordelon, Cengiz Pehlevan
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The generalization performance of a machine learning algorithm such as a neural network depends in an intricate way on the structure of the data distribution. To analyze the influence of data structure on test loss dynamics, we study an exactly solveable model of stochastic gradient descent (SGD) which predicts test loss when training on features with arbitrary covariance structure. We solve the theory exactly for both Gaussian features and arbitrary features and we show that the simpler Gaussian model accurately predicts test loss of nonlinear randomfeature models and deep neural networks trained with SGD on real datasets such as MNIST and CIFAR-10. We show that the optimal batch size at a fixed compute budget is typically small and depends on the feature correlation structure, demonstrating the computational benefits of SGD with small batch sizes. Lastly, we extend our theory to the more usual setting of stochastic gradient descent on a fixed subsampled training set, showing that both training and test error can be accurately predicted in our framework on real data.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.02713")
get_code_for_paper("2106.02713")
have("2106.02713")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.02713.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.02713)
Connect an agent — have() is free.