The authors analytically demonstrated that if the size of the sample is N, and we want to correctly classify future observations with at least a fraction (1−ε/2), then the size of the sample has a lower bound given by W N N ≥ 0 log , ε ε where W is the number of the weights and N is the number of the nodes in a network..