13 1 Associative Learning

13 2 Simple Associative Network

13 3 Banana Associator Unconditioned StimulusConditioned Stimulus

13 4 Unsupervised Hebb Rule Vector Form: Training Sequence:

13 5 Banana Recognition Example Initial Weights: Training Sequence: a1  hardlimw 0 p 0 1  w0  p1  0.5–+  hardlim10  01  –+  0 (no response) = == First Iteration (sight fails):  = 1

13 6 Example a2  hardlimw 0 p 0 2  w1  p2  0.5–+  hardlim11  01  –+  1 (banana) = == Second Iteration (sight works): Third Iteration (sight fails): Banana will now be detected if either sensor works.

13 7 Problems with Hebb Rule Weights can become arbitrarily large There is no mechanism for weights to decrease

13 8 Hebb Rule with Decay This keeps the weight matrix from growing without bound, which can be demonstrated by setting both a i and p j to 1:

13 9 Example: Banana Associator a1  hardlimw 0 p 0 1  w0  p1  0.5–+  hardlim10  01  –+  0 (no response) = == First Iteration (sight fails): a2  hardlimw 0 p 0 2  w1  p2  0.5–+  hardlim11  01  –+  1 (banana) = == Second Iteration (sight works):  = 0.1  = 1

13 10 Example Third Iteration (sight fails): Hebb RuleHebb with Decay

13 11 Problem of Hebb with Decay Associations will decay away if stimuli are not occasionally presented. If a i = 0, then If  = 0, this becomes Therefore the weight decays by 10% at each iteration where there is no stimulus.

13 12 Instar (Recognition Network)

13 Instar Operation The instar will be active when or w T 1 pw 1 p  cosb–  = For normalized vectors, the largest inner product occurs when the angle between the weight vector and the input vector is zero -- the input vector is equal to the weight vector. The rows of a weight matrix represent patterns to be recognized.

13 14 Vector Recognition b w 1 p –= If we set the instar will only be active when   =  0. b w 1 p –> If we set the instar will be active for a range of angles. As b is increased, the more patterns there will be (over a wider range of  ) which will activate the instar. w 1

13 15 Instar Rule Hebb with Decay Modify so that learning and forgetting will only occur when the neuron is active - Instar Rule: w ij q  w ij q1–  a i q  p j q  a i q  wq1–  –+= ij or Vector Form:

13 16 Graphical Representation For the case where the instar is active (a i = 1): or For the case where the instar is inactive (a i = 0):

13 17 Example

13 18 Training First Iteration (  =1):

13 19 Further Training (orange) h a2  hardlimw 0 p 0 2  Wp 2  2–+  = ardlim31  – 1– 2–+      1== a3  hardlimw 0 p 0 3  Wp 3  2–+  = hardlim30  11–1– 1 1– 1– 2–+      1== Orange will now be detected if either set of sensors works.

13 20 Kohonen Rule Learning occurs when the neuron’s index i is a member of the set X(q). We will see in Chapter 14 that this can be used to train all neurons in a given neighborhood.

13 21 Outstar (Recall Network)

13 22 Outstar Operation Suppose we want the outstar to recall a certain pattern a* whenever the input p = 1 is presented to the network. Let Then, when p = 1 and the pattern is correctly recalled. The columns of a weight matrix represent patterns to be recalled.

13 23 Outstar Rule For the instar rule we made the weight decay term of the Hebb rule proportional to the output of the network. For the outstar rule we make the weight decay term proportional to the input of the network. If we make the decay rate  equal to the learning rate , Vector Form:

13 24 Example - Pineapple Recall

13 25 Definitions

13 26 Iteration 1  = 1

13 27 Convergence