The Connectionist Approach Flashcards
Connectionism
Approach to creating computer models for representing cognitive processes
Also called “parallel distributed processing” models because they propose concepts that are represented in the distributed activity of many linked units
Input units
Activated by stimulation from the environment
Hidden units
Receive input from input units
Output units
Receive input from hidden units
Connection weights
Determine how strongly signals from one unit increase or decrease activity of next unit
How do connectionist networks learn?
Don’t have knowledge programmed in
They begin with equal or random response parameters, then the network is trained over many trials
If a mistake is made, error signal is generated
back-propagation
Process wherein error signal transmitted back through circuit
Indicated how connection weights should be changed to allow the output signal to match the correct signal, process repeats until error is zero
graceful degradation
Disruption of performance occurs gradually as parts of the system are damaged
Advantages
Success in simulating cognitive processes
Can explain generalization of learning (similar concepts will have similar connectionist patterns)
Seems analogous to real brains/neurons