Before revision:  As a consequence, this new network overcomes  the curse of dimensionality in approximation power since this approximation order is\le  } essentially \sqrt{d} times a function of N and L independent of d .
After revision:  As a consequence, this new network overcomes the curse of dimensionality in approximation power since this approximation order is\le }lder continuous functions), since the major term to be concerned in our approximation rate is essentially \sqrt{d} times a function of N and L independent of d .