Remark 4.5 If we assume that \(\prod _{j=1}^{d} M(j)\)  is upper bounded by a constant, the first term in the \(\min \)  argument is independent of the depth \(d\) . Although this may be a very strong assumption in practice [1]}, it leads to a depth-independent upper bound for sample complexity of polynomial neural networks.

