On the capacity of an associative memory model based on neural cliques

DOI10.1016/J.SPL.2015.07.026zbMath1328.82041arXiv1411.1224OpenAlexW973735509MaRDI QIDQ900566

Judith Heusel, Franck Vermet, Matthias Loewe

Publication date: 22 December 2015

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.1224

zbMATH Keywords

neural networksassociative memoryexponential inequalities

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Neural nets applied to problems in time-dependent statistical mechanics (82C32)

Related Items (2)

A comparative study of sparse associative memories ⋮ Index structures for fast similarity search for binary vectors

Cites Work

• The Hopfield model on a sparse Erdös-Renyi graph
• Lower bounds on the restitution error in the Hopfield model
• On the storage capacity of Hopfield models with correlated patterns
• Rigorous results for the Hopfield model with many patterns
• The storage capacity of the Hopfield model and moderate deviations
• The capacity of the Hopfield associative memory
• The storage capacity of the Blume–Emery–Griffiths neural network
• Nondirect convergence radius and number of iterations of the Hopfield associative memory
• Sharp upper bounds on perfect retrieval in the Hopfield model

This page was built for publication: On the capacity of an associative memory model based on neural cliques