The Randomness of Input Data Spaces is an A Priori Predictor for Generalization
Not on the map. Why?
Abstract (arXiv)
Over-parameterized models can perfectly learn various types of data distributions, however, generalization error is usually lower for real data in comparison to artificial data. This suggests that the properties of data distributions have an impact on generalization capability. This work focuses on the search space defined by the input data and assumes that the correlation between labels of neighboring input values influences generalization. If correlation is low, the randomness of the input data space is high leading to high generalization error. We suggest to measure the randomness of an input data space using Maurer's universal. Results for synthetic classification tasks and common image classification benchmarks (MNIST, CIFAR10, and Microsoft's cats vs. dogs data set) find a high correlation between the randomness of input data spaces and the generalization error of deep neural networks for binary classification problems.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 52 references that are in the map. First posted on arXiv 8 Jun 2021.
Builds on
23 of 52 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2013Auto-Encoding Variational Bayescited by 4,053
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2017A Closer Look at Memorization in Deep Networkscited by 942
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2017Exploring Generalization in Deep Learningcited by 600
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
11 more
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 314
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2015Norm-Based Capacity Control in Neural Networkscited by 299
- 2017Size-Independent Sample Complexity of Neural Networkscited by 290
- 2019Uniform convergence may be unable to explain generalization in deep learningcited by 224
- 2017Generalization in Deep Learningcited by 146
- 2017A Bayesian Perspective on Generalization and Stochastic Gradient Descentcited by 135
- 2018Non-Vacuous Generalization Bounds at the ImageNet Scale: A PAC-Bayesian Compression Approachcited by 126
- 2017Fisher-Rao Metric, Geometry, and Complexity of Neural Networkscited by 100
- 2018A Priori Estimates of the Population Risk for Two-layer Neural Networkscited by 76
- 2018Deep Neural Networks Learn Non-Smooth Functions Effectivelycited by 57
Built on by
Not cited yet.