Escaping Parameter Space: Tight Generalization Bounds via Representation Quality
Advances theoretical understanding of neural network generalization with practical diagnostic tools for ML researchers.
AI Summary
Researchers derive tight generalization bounds for neural networks using representation quality metrics instead of traditional parameter-space complexity measures, achieving non-vacuous certificates on CIFAR-100 for the first time.
Excerpt
We derive a tight generalization bound for deterministic neural We derive a tight generalization bound for deterministic neural networks based on their last hidden layer representations. By evaluating representation quality with a parameter-free $k$-nearest-neighbor ($k$-NN) classifier, our certificate avoids traditional parameter-space complexity measures, KL divergences to a posterior, weight norms, and compression. The bound is tight: trained from scratch, it reaches an 8.0 percentage point g
