Learning Non-Vacuous Generalization Bounds from Optimization

📰 ArXiv cs.AI

arXiv:2206.04359v3 Announce Type: replace-cross Abstract: One of the fundamental challenges in the deep learning community is to theoretically understand how well a deep neural network generalizes to unseen data. However, current approaches often yield generalization bounds that are either too loose to be informative of the true generalization error or only valid to the compressed nets. In this study, we present a simple yet non-vacuous generalization bound from the optimization perspective. We

Published 25 Jun 2026
Read full paper → ← Back to Reads