Consecutive and non-consecutive heteroclinic cycles in Hopfield networks
- Creators
- Chossat, Pascal
- Krupa, Martin
- Others:
- COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)
- Mathématiques pour les Neurosciences (MATHNEURO) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- Laboratoire Jean Alexandre Dieudonné (JAD) ; Université Nice Sophia Antipolis (1965 - 2019) (UNS) ; COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)
- This work was partially supported by the European Union Seventh Framework Programme (FP7/2007-2013) [grant number 269921 (BrainScaleS)], [grant number 318723 (Mathemacs)]; ERC advanced grant NerVi [grant number 227747].
- European Project: 269921,EC:FP7:ICT,FP7-ICT-2009-6,BRAINSCALES(2011)
- European Project: 318723,EC:FP7:ICT,FP7-ICT-2011-8,MATHEMACS(2012)
- European Project: 227747,EC:FP7:ERC,ERC-2008-AdG,NERVI(2009)
Description
We review and extend the previous work where a model was introduced for Hopfield-type neural networks, which allows for the existence of heteroclinic dynamics between steady patterns. This dynamics is a mathematical model of periodic or aperiodic switching between stored information items in the brain, in particular, in the context of sequential memory or cognitive tasks as observed in experiments. The basic question addressed in this work is whether, given a sequence of steady patterns, it is possible by applying classical learning rules to build a matrix of connections between neurons in the network, such that a heteroclinic dynamics links these patterns. It has been shown previously that the answer is positive in the case where the sequence is a so-called simple consecutive cycle. We show that on the contrary the answer is negative for a non-simple cycle: heteroclinic dynamics does still exist; however, it cannot follow the sequence of patterns from which the connectivity matrix was derived.
Abstract
International audience
Additional details
- URL
- https://hal.inria.fr/hal-01654634
- URN
- urn:oai:HAL:hal-01654634v1
- Origin repository
- UNICA