A note on greedy algorithm
The greedy algorithm is one of the important tools in neural network approximation. The authors construct a greedy algorithm using the arithmetic average of elements of a given subset in a normed linear space. Further, they show that the degree of approximation order is \(O(n^{-1/2})\), which offers a good approximation method for neural networks.
scientific article; zbMATH DE number 1623268