Storage capacity of a constructive learning algorithm
Storage capacity of a constructive learning algorithm
Upper and lower bounds for the typical storage capacity of a constructive algorithm, the tilinglike learning algorithm for the parity machine (Biehl M and Opper M 1991 Phys. Rev.A 446888), are determined in the asymptotic limit of large training set sizes. The properties of a perceptron with threshold, learning a …