title: Regarding the temporal requirements of a hierarchical Willshaw network.
abstract: In a recent communication, Sacramento and Wichert (2011) proposed a hierarchical retrieval prescription for Willshaw-type associative networks. Through simulation it was shown that one could make use of low resolution descriptor patterns to decrease the total time requirements of recalling a learnt association. However, such a method introduced a dependence on a set of new parameters which define the structure of the hierarchy. In this work we compute the expected retrieval time for the random neural activity regime which maximises the capacity of the Willshaw model and we study the task of finding the optimal hierarchy parametrisation with respect to the derived temporal expectation. Still in regard to this performance measure, we investigate some asymptotic properties of the algorithm.
authors.affiliation: INESC-ID Lisboa and Instituto Superior Técnico, Technical University of Lisbon, Av. Prof. Dr. Aníbal Cavaco Silva, 2744-016 Porto Salvo, Portugal. joao.sacramento@ist.utl.pt
authors.forename: João
authors.initials: J
authors.lastname: Sacramento
authors.forename: Francisco
authors.initials: F
authors.lastname: Burnay
authors.forename: Andreas
authors.initials: A
authors.lastname: Wichert
mesh_terms: D000465:Algorithms; D007858:Learning / Q000502:physiology; D016571:Neural Networks, Computer; D013997:Time Factors