AssociativeModels-ComputerScienceandElectrical.pptVIP

Example: A 4 node network, stores 2 patterns (1 1 1 1) and (-1 -1 -1 -1) Weights: Corrupted input pattern: (1 1 1 -1) Node output selection pattern node 2: (1 1 1 -1) node 4: (1 1 1 1) No more change of state will occur, the correct pattern is recovered Equaldistance: (1 1 -1 -1) node 2: net = 0, no change (1 1 -1 -1) node 3: net = 0, change state from -1 to 1 (1 1 1 -1) node 4: net = 0, change state from -1 to 1 (1 1 1 1) No more change of state will occur, the correct pattern is recovered If a different tie breaker is used (if input = 0, output -1), the stored pattern (-1 -1 -1 -1) will be recalled In more complicated situations, different order of node selections may lead the system to converge to different attractors. Missing input element: (1 0 -1 -1) Node output selection pattern node 2: (1 -1 -1 -1) node 1: net = -2, change state to -1 (-1 -1 -1 -1) No more change of state will occur, the correct pattern is recovered Missing input elements: (0 0 0 -1) the correct pattern (-1 -1 -1 -1) is recovered This is because the AM has only 2 attractors (1 1 1 1) and (-1 -1 -1 -1) When spurious attractors exist (with more memories), pattern completion may be incorrect (been attracted to wrong, spurious attractors). Convergence Analysis of DHM Two questions: 1. Will Hopfield AM converge (stop) with any given recall input? 2. Will Hopf