Tight bounds on rates of neural-network approximation

Complexity of neural networks measured by the number of hidden units is studied in terms of rates of approximation. Limitations of improvements of upper bounds of the order of O(n-1/2) on such rates are investigated for perceptron networks with some periodic and sigmoidal activation functions.