In [1]} the authors show another line of proof techniques that gives rise to the first depth-independent upper bound on sample complexity of neural networks. Their main idea follows these two observations:
