Temporal Complexity of a Hopfield-Type Neural Model in Random and Scale-Free Graphs

Marco Cafiso, Marco Cafiso, Paolo Paradisi, Paolo Paradisi

2024

Abstract

The Hopfield network model and its generalizations were introduced as a model of associative, or content-addressable, memory. They were widely investigated both as an unsupervised learning method in artificial intelligence and as a model of biological neural dynamics in computational neuroscience. The complexity features of biological neural networks have attracted the scientific community’s interest for the last two decades. More recently, concepts and tools borrowed from complex network theory were applied to artificial neural networks and learning, thus focusing on the topological aspects. However, the temporal structure is also a crucial property displayed by biological neural networks and investigated in the framework of systems displaying complex intermittency. The Intermittency-Driven Complexity (IDC) approach indeed focuses on the metastability of self-organized states, whose signature is a power-decay in the inter-event time distribution or a scaling behaviour in the related event-driven diffusion processes. The investigation of IDC in neural dynamics and its relationship with network topology is still in its early stages. In this work, we present the preliminary results of an IDC analysis carried out on a bio-inspired Hopfield-type neural network comparing two different connectivities, i.e., scale-free vs. random network topology. We found that random networks can trigger complexity features similar to that of scale-free networks, even if with some differences and for different parameter values, in particular for different noise levels.

Download


Paper Citation


in Harvard Style

Cafiso M. and Paradisi P. (2024). Temporal Complexity of a Hopfield-Type Neural Model in Random and Scale-Free Graphs. In Proceedings of the 16th International Joint Conference on Computational Intelligence - Volume 1: NCTA; ISBN 978-989-758-721-4, SciTePress, pages 438-448. DOI: 10.5220/0013007600003837


in Bibtex Style

@conference{ncta24,
author={Marco Cafiso and Paolo Paradisi},
title={Temporal Complexity of a Hopfield-Type Neural Model in Random and Scale-Free Graphs},
booktitle={Proceedings of the 16th International Joint Conference on Computational Intelligence - Volume 1: NCTA},
year={2024},
pages={438-448},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0013007600003837},
isbn={978-989-758-721-4},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Joint Conference on Computational Intelligence - Volume 1: NCTA
TI - Temporal Complexity of a Hopfield-Type Neural Model in Random and Scale-Free Graphs
SN - 978-989-758-721-4
AU - Cafiso M.
AU - Paradisi P.
PY - 2024
SP - 438
EP - 448
DO - 10.5220/0013007600003837
PB - SciTePress