Answers are grounded in this paper and cite their sources.
The efficiency of the orthogonal least squares (OLS) method for training approximation networks is examined using the criterion of energy compaction. We show that the selection of basis vectors produced by the procedure is not the most compact when the approximation is performed using a nonorthogonal basis. Hence, the algorithm does not produce the smallest possible networks for a given approximation error. Specific examples are given using the Gaussian radial basis functions type of approximation networks.
No takes yet. Share an insight, caveat, or question.
Sherstinsky et al. (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: