A Hopfield network stores patterns as attractors via Hebbian learning: W = (1/N)Σ_μ ξ^μ ξ^μᵀ. Capacity limit ~0.138N patterns (Amit-Gutfreund-Sompolinsky). Beyond this, memories become confused.
Stored patterns
Recall (noisy probe)
After convergence