The modified unlearning procedure for enhancing storage capacity in Hopfield network

The authors propose a solvable iterative algorithm of unlearning type for self-correction of Hebbian connectivity. It is shown that, for almost all unlearning sequences, the resulting connection matrix asymptotically converges to the projector matrix. The corresponding convergence rate is calculated and confirmed with numerical simulations.<>