On Neural Associative Memory Structures: Storage and Retrieval of Sequences in a Chain of Tournaments.

Journal: Neural computation
Published Date:

Abstract

Associative memories enjoy many interesting properties in terms of error correction capabilities, robustness to noise, storage capacity, and retrieval performance, and their usage spans over a large set of applications. In this letter, we investigate and extend tournament-based neural networks, originally proposed by Jiang, Gripon, Berrou, and Rabbat (2016), a novel sequence storage associative memory architecture with high memory efficiency and accurate sequence retrieval. We propose a more general method for learning the sequences, which we call feedback tournament-based neural networks. The retrieval process is also extended to both directions: forward and backward-in other words, any large-enough segment of a sequence can produce the whole sequence. Furthermore, two retrieval algorithms, cache-winner and explore-winner, are introduced to increase the retrieval performance. Through simulation results, we shed light on the strengths and weaknesses of each algorithm.

Authors

  • Asieh Abolpour Mofrad
    Selmer Center, Department of Informatics, University of Bergen, 5020 Bergen, Norway asieh.abolpour-mofrad@oslomet.no.
  • Samaneh Abolpour Mofrad
    Department of Computer Science, Electrical Engineering, and Mathematical Sciences, Western Norway University of Applied Sciences, 5063 Bergen, Norway, and Mohn Medical Imaging and Visualization Center, Haukeland University Hospital, 5021 Bergen, Norway Samaneh.Abolpour.Mofrad@hvl.no.
  • Anis Yazidi
    Department of Computer Science, Oslo Metropolitan University, Oslo, Norway.
  • Matthew Geoffrey Parker
    Selmer Center, Department of Informatics, University of Bergen, 5020 Bergen, Norway Matthew.Parker@ii.uib.no.