Fantastic Generalization Measures and Where to Find Them

Abstract

Generalization of deep networks has been of great interest in recent years, resulting in a number of theoretically and empirically motivated complexity measures. However, most papers proposing such measures study only a small set of models, leaving open the question of whether the conclusion drawn from those experiments would remain valid in other settings. We present the first large scale study of generalization in deep networks. We investigate more then 40 complexity measures taken from both theoretical bounds and empirical studies. We train over 10,000 convolutional networks by systematically varying commonly used hyperparameters. Hoping to uncover potentially causal relationships between each measure and generalization, we analyze carefully controlled experiments and show surprising failures of some measures as well as promising measures for further research.

References in corpus (6)

• On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima
• Regularizing and Optimizing LSTM Language Models
• Regularizing Neural Networks by Penalizing Confident Output Distributions
• Path-SGD: Path-Normalized Optimization in Deep Neural Networks
• Generalization in Deep Networks: The Role of Distance from Initialization
• Deterministic PAC-Bayesian generalization bounds for deep networks via generalizing noise-resilience