Answers are grounded in this paper and cite their sources.
We study an algorithm for a feedforward network which is similar in spirit to the Tiling algorithm recently introduced: the hidden units are added one by one until the network performs the desired task, and convergence is guaranteed. The difference is in the architecture of the network, which is more constrained here. Numerical tests show performances similar to that of the Tiling algorithm, although the total number of couplings in general grows faster.
No takes yet. Share an insight, caveat, or question.
Jean‐Pierre Nadal (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: