5 citations · 5 across the 1 of their papers we have counts for
1 paper
Amit Daniely, Elad Granot
We investigate the sample complexity of networks with bounds on the magnitude of its weights. In particular, we consider the class \[ H=\left\{W_t\circρ\circ \ldots\circρ\circ W_{1…