We seek to test if an auto-associative network is capable of recalling certain memories. Here you will test if patterns can be completed or recovered. You are given a single pattern s = (1, 1, 1, -1) which is stored in the weights W computed using Hebbian learning.
Determine if the following patterns can be recalled (Yes or No). Show your work and explain how you arrived at each conclusion. Full credit depends on showing your work.
• Training pattern (1 1 1 -1)
• Small noise pattern (-1 1 1 -1)
• Incomplete pattern (0 0 1 -1)
• Large noise pattern (-1 -1 1 -1)