Size-independent sample complexity of neural networks
We study the sample complexity of learning neural networks by providing new bounds on their Rademacher complexity, assuming norm constraints on the parameter matrix of each layer. Compared to previous work, these complexity bounds have improved dependence on the network depth and, under some additio...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Oxford University Press (OUP)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/138309 |