Abstract:
It is shown that an adaptive threshold logic element (ATLE) whose weight vector is perturbed reconverges without error provided its threshold is large compared with the p...Show MoreMetadata
Abstract:
It is shown that an adaptive threshold logic element (ATLE) whose weight vector is perturbed reconverges without error provided its threshold is large compared with the perturbation. This result is generalized to a criterion of convergence, based on admissibility, for the nonseparable case. It is shown that conventional ATLE's cannot cope with nonseparability even according to this very weak criterion.
Published in: IEEE Transactions on Computers ( Volume: C-26, Issue: 1, January 1977)