Optimising synaptic learning rules in linear associative memories

DOI10.1007/BF00206223MaRDI QIDQ1182329zbMATH OpenDBLPWikidataFDO

Authors David Willshaw, Peter Dayan

Publication date 28 June 1992

Published in Biological Cybernetics (Search for Journal in Brave)

zbMATH Keywords

learning ruleassociative matrix memorycovariance rulelinear associative memoriesmaximization of the signal-to-noise ratiosynaptic learning rules

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural biology (92C20) Neural networks for/in biological studies, artificial life and related topics (92B20)

Recommendations

• Neural associative memory with optimal Bayesian learning
• Optimal learning rules for familiarity detection
• Inhomogeneities in Heteroassociative Memories with Linear Learning Rules
• Stability and attractivity in associative memory networks
• Efficient Associative Computation with Discrete Synapses

Cites work

• scientific article; zbMATH DE number 42973 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• Correlation Matrix Memories
• Neural networks and physical systems with emergent collective computational abilities
• The space of interactions in neural network models

Cited in

(16)

• Memory Capacities for Synaptic and Structural Plasticity
• Spike-Timing-Dependent Plasticity and Relevant Mutual Information Maximization
• Effective neuronal learning with ineffective Hebbian learning rules
• Inhomogeneities in Heteroassociative Memories with Linear Learning Rules
• Dendritic morphology predicts pattern recognition performance in multi-compartmental model neurons with and without active conductances
• Optimal learning rules for familiarity detection
• Neural associative memory with optimal Bayesian learning
• Iterative retrieval and block coding in autoassociative and heteroassociative memory
• ``Live neuron and optimal learning rule
• Binary Willshaw learning yields high synaptic capacity for long-term familiarity memory
• Efficient Associative Computation with Discrete Synapses
• Memory dynamics in attractor networks with saliency weights
• Associative learning using Ising-like model
• Associative Memory with Dynamic Synapses
• Studying associative learning without solving learning equations
• Learning flexible sensori-motor mappings in a complex network

This page was built for publication: Optimising synaptic learning rules in linear associative memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182329)