Associative memory: on the (puzzling) sparse coding limit
From MaRDI portal
Publication:5752058
DOI10.1088/0305-4470/24/5/023zbMath0719.68514OpenAlexW1973144389MaRDI QIDQ5752058
Publication date: 1991
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0305-4470/24/5/023
Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20) Circuits, networks (94C99)
Related Items
Learning Classification in the Olfactory System of Insects ⋮ Optimizing One-Shot Learning with Binary Synapses ⋮ Storing structured sparse memories in a multi-modular cortical network model ⋮ Efficient Associative Computation with Discrete Synapses ⋮ Precise Capacity Analysis in Binary Networks with Multiple Coding Level Inputs ⋮ Inhibition enhances memory capacity: optimal feedback, transient replay and oscillations ⋮ Neural Associative Memory with Optimal Bayesian Learning ⋮ Inhomogeneous sparseness leads to dynamic instability during sequence memory recall in a recurrent neural network model ⋮ Memory Capacities for Synaptic and Structural Plasticity ⋮ Memory Capacity for Sequences in a Recurrent Network with Biological Constraints
