Answers are grounded in this paper and cite their sources.
The typical fraction of the space of interactions between each pair of N Ising spins which solve the problem of storing a given set of p random patterns as N-bit spin configurations is considered. The volume is calculated explicitly as a function of the storage ratio, a = p / N, of the value K (> O) of the product of the spin and the magnetic field at each site and of the magnetisation, m. Here m may vary between 0 (no correlation) and 1 (completely correlated). The capacity increases with the correlation between patterns from a = 2 for correlated patterns with K = 0 and tends to infinity as m tends to 1. The calculations use a saddle-point method and the order parameters at the saddle point are assumed to be replica symmetric. This solution is shown to be locally stable. A local iterative learning algorithm for updating the interactions is given which will converge to a solution of given K provided such solutions exist.
No takes yet. Share an insight, caveat, or question.
E. Gardner (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: