摘要: We study an algorithm for a feedforward network which is similar in spirit to the Tiling recently introduced: hidden units are added one by until performs desired task, and convergence guaranteed. The difference architecture of network, more constrained here. Numerical tests show performances that algorithm, although total number couplings general grows faster.
sci-hub.se 参考文章(0)