57
Views
55
CrossRef citations to date
0
Altmetric
Original Article

Information storage in sparsely coded memory nets

&
Pages 61-74 | Received 07 Jun 1989, Published online: 04 Aug 2009

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (11)

Miguel Maravall. (1999) Sparsification from dilute connectivity in a neural network model of memory. Network: Computation in Neural Systems 10:1, pages 15-39.
Read now
Nicolas Brunel, Francesco Carusi & Stefano Fusi. (1998) Slow stochastic Hebbian learning of classes of stimuli in a recurrent neural network. Network: Computation in Neural Systems 9:1, pages 123-152.
Read now
Bruce Graham & David Willshaw. (1997) Capacity and information efficiency of the associative net. Network: Computation in Neural Systems 8:1, pages 35-54.
Read now
A A Frolov & I P Murav'ev. (1993) Informational characteristics of neural networks capable of associative learning based on Hebbian plasticity. Network: Computation in Neural Systems 4:4, pages 495-536.
Read now
Jay Buckingham & David Willshaw. (1993) On setting unit thresholds in an incompletely connected associative net. Network: Computation in Neural Systems 4:4, pages 441-459.
Read now
Jay Buckingham & David Willshaw. (1992) Performance characteristics of the associative net. Network: Computation in Neural Systems 3:4, pages 407-414.
Read now
G Palm & F T Sommer. (1992) Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states. Network: Computation in Neural Systems 3:2, pages 177-186.
Read now
Claude Meunier, Hiro-Fumi Yanai & Shun-ichi Amari. (1991) Sparsely coded associative memories: capacity and dynamical properties. Network: Computation in Neural Systems 2:4, pages 469-487.
Read now
Hiro-Fumi Yanai, Yasuji Sawada & Shuji Yoshizawa. (1991) Dynamics of an auto-associative neural network model with arbitrary connectivity and noise in the threshold. Network: Computation in Neural Systems 2:3, pages 295-314.
Read now
J A Sirat & J-P Nadal. (1990) Neural trees: a new tool for classification. Network: Computation in Neural Systems 1:4, pages 423-438.
Read now
Edmund T Rolls & Alessandro Treves. (1990) The relative advantages of sparse versus distributed encoding for associative neuronal networks in the brain. Network: Computation in Neural Systems 1:4, pages 407-421.
Read now

Articles from other publishers (44)

Louis Kang & Taro Toyoizumi. (2023) Hopfield-like network with complementary encodings of memories. Physical Review E 108:5.
Crossref
Rodrigo Simas, Luis Sa-Couto & Andreas Wichert. (2023) Classification and generation of real-world data with an associative memory model. Neurocomputing 551, pages 126514.
Crossref
Francesca Schönsberg, Yasser Roudi & Alessandro Treves. (2021) Efficiency of Local Learning Rules in Threshold-Linear Associative Networks. Physical Review Letters 126:1.
Crossref
Luis Sa-Couto & Andreas Wichert. (2020) Storing Object-Dependent Sparse Codes in a Willshaw Associative Network. Neural Computation 32:1, pages 136-152.
Crossref
Karen Safaryan, Reinoud Maex, Neil Davey, Rod Adams & Volker Steuber. (2017) Nonspecific synaptic plasticity improves the recognition of sparse patterns degraded by local noise. Scientific Reports 7:1.
Crossref
Andreas Knoblauch. 2017. The Rewiring Brain. The Rewiring Brain 361 386 .
Andreas Knoblauch. (2016) Efficient Associative Computation with Discrete Synapses. Neural Computation 28:1, pages 118-186.
Crossref
Julius Stroffek & Petr Marsalek. (2012) Short-term potentiation effect on pattern recall in sparsely coded neural network. Neurocomputing 77:1, pages 108-113.
Crossref
Yali AmitYibi Huang. (2010) Precise Capacity Analysis in Binary Networks with Multiple Coding Level Inputs. Neural Computation 22:3, pages 660-688.
Crossref
Andreas Knoblauch, Günther Palm & Friedrich T. Sommer. (2010) Memory Capacities for Synaptic and Structural Plasticity. Neural Computation 22:2, pages 289-341.
Crossref
Andrea Greve, David C. Sterratt, David I. Donaldson, David J. Willshaw & Mark C. W. van Rossum. (2008) Optimal learning rules for familiarity detection. Biological Cybernetics 100:1, pages 11-19.
Crossref
Stephen Hobson & Jim Austin. 2009. Artificial Neural Networks – ICANN 2009. Artificial Neural Networks – ICANN 2009 728 736 .
Sandro Romani, Daniel J. AmitYali Amit. (2008) Optimizing One-Shot Learning with Binary Synapses. Neural Computation 20:8, pages 1928-1950.
Crossref
Julius Stroffek, Eduard Kuriscak & Petr Marsalek. (2007) Pattern storage in a sparsely coded neural network with cyclic activation. Biosystems 89:1-3, pages 257-263.
Crossref
Christian LeiboldRichard Kempter. (2006) Memory Capacity for Sequences in a Recurrent Network with Biological Constraints. Neural Computation 18:4, pages 904-941.
Crossref
Nicolas Brunel, Vincent Hakim, Philippe Isope, Jean-Pierre Nadal & Boris Barbour. (2004) Optimal Information Storage and the Distribution of Synaptic Weights. Neuron 43:5, pages 745-757.
Crossref
Ramón Huerta, Thomas NowotnyMarta García-SanchezH. D. I. AbarbanelM. I. Rabinovich. (2004) Learning Classification in the Olfactory System of Insects. Neural Computation 16:8, pages 1601-1640.
Crossref
Francisco J. López Aligué, Isabel Acevedo Sotoca, Ignacio Alvarez Troncoso, Carlos J. García Orellana & Horacio González Velasco. 2002. Advances in Artificial Intelligence — IBERAMIA 2002. Advances in Artificial Intelligence — IBERAMIA 2002 430 439 .
D Bollé & G Massolo. (2000) Thresholds in layered neural networks with variable activity. Journal of Physics A: Mathematical and General 33:14, pages 2597-2609.
Crossref
Miguel Maravall. (1999) Sparsification from dilute connectivity in a neural network model of memory. Network: Computation in Neural Systems 10:1, pages 15-39.
Crossref
Nicolas Brunel, Francesco Carusi & Stefano Fusi. (1998) Slow stochastic Hebbian learning of classes of stimuli in a recurrent neural network. Network: Computation in Neural Systems 9:1, pages 123-152.
Crossref
Bruce Graham & David Willshaw. (1997) Capacity and information efficiency of the associative net. Network: Computation in Neural Systems 8:1, pages 35-54.
Crossref
Bruce Graham & David Willshaw. 1996. Artificial Neural Networks — ICANN 96. Artificial Neural Networks — ICANN 96 35 40 .
Daniel Amit†Nicolas Brunel. (1995) Learning internal representations in an attractor neural network with analogue neurons. Network: Computation in Neural Systems 6:3, pages 359-388.
Crossref
Bruce Graham & David Willshaw. (1995) Improving recall from an associative memory. Biological Cybernetics 72:4, pages 337-346.
Crossref
Jay Buckingham & David Willshaw. (1993) On setting unit thresholds in an incompletely connected associative net. Network: Computation in Neural Systems 4:4, pages 441-459.
Crossref
H J J Jonker & A C C Coolen. (1993) Learning in neural networks by eliminating frustrated bonds. Journal of Physics A: Mathematical and General 26:3, pages 563-579.
Crossref
J. M. Moreno, F. Castillo & J. Cabestany. 1993. New Trends in Neural Computation. New Trends in Neural Computation 272 277 .
Jay Buckingham & David Willshaw. (1992) Performance characteristics of the associative net. Network: Computation in Neural Systems 3:4, pages 407-414.
Crossref
N Brunel, J -P Nadal & G Toulouse. (1992) Information capacity of a perceptron. Journal of Physics A: Mathematical and General 25:19, pages 5017-5038.
Crossref
Günther Palm. (1992) On the Information Storage Capacity of Local Learning Rules. Neural Computation 4:5, pages 703-711.
Crossref
Maciej Lewenstein & Wojciech Tarkowski. (1992) Optimal storage of correlated patterns in neural-network memories. Physical Review A 46:4, pages 2139-2142.
Crossref
G Palm & F Sommer. (1992) Information capacity in recurrent McCulloch–Pitts networks with sparsely coded memory states. Network: Computation in Neural Systems 3:2, pages 177-186.
Crossref
Claude Meunier, Hiro-Fumi Yanai & Shun-ichi Amari. (1991) Sparsely coded associative memories: capacity and dynamical properties. Network: Computation in Neural Systems 2:4, pages 469-487.
Crossref
Hiro-Fumi Yanai, Yasuji Sawada & Shuji Yoshizawa. (1991) Dynamics of an auto-associative neural network model with arbitrary connectivity and noise in the threshold. Network: Computation in Neural Systems 2:3, pages 295-314.
Crossref
A C C Coolen. (1991) Analytical expressions for neural interactions which improve upon the projector rule. Journal of Physics A: Mathematical and General 24:11, pages 2665-2675.
Crossref
Jean-P Nadal. (1991) Associative memory: on the (puzzling) sparse coding limit. Journal of Physics A: Mathematical and General 24:5, pages 1093-1101.
Crossref
Vernon G. Dobson & José Ma Salinas. 1991. Artificial Neural Networks. Artificial Neural Networks 181 188 .
M Bouten, A Engel, A Komoda & R Serneels. (1990) Quenched versus annealed dilution in neural networks. Journal of Physics A: Mathematical and General 23:20, pages 4643-4657.
Crossref
J Sirat & J-P Nadal. (1990) Neural trees: a new tool for classification. Network: Computation in Neural Systems 1:4, pages 423-438.
Crossref
Edmund Rolls & Alessandro Treves. (1990) The relative advantages of sparse versus distributed encoding for associative neuronal networks in the brain. Network: Computation in Neural Systems 1:4, pages 407-421.
Crossref
H Gutfreund & Y Stein. (1990) Capacity of neural networks with discrete synaptic couplings. Journal of Physics A: Mathematical and General 23:12, pages 2613-2630.
Crossref
. 1990. Advanced Neural Computers. Advanced Neural Computers 391 434 .
Günther PALM. 1990. Advanced Neural Computers. Advanced Neural Computers 145 150 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.