Search for notes by fellow students, in your own course and all over the country.
Browse our notes for titles which look like what you need, you can preview any of the notes via a sample of the contents. After you're happy these are the notes you're after simply pop them into your shopping cart.
Title: Serially Ordered Actions
Description: Computational Neuroscience- How the brain codes for serially ordered actions Lecture notes by Professor Neil Burgess at UCL for the course computational neuroscience module for neuroscience BSc (3rd year)
Description: Computational Neuroscience- How the brain codes for serially ordered actions Lecture notes by Professor Neil Burgess at UCL for the course computational neuroscience module for neuroscience BSc (3rd year)
Document Preview
Extracts from the notes are below, to see the PDF you'll receive please use the links above
6th December (29
...
g
...
Associative chaining
a
...
E
...
this might apply to alphabet learning
2
...
g
...
We want to start the network off somehow and then make it produce sequence of
actions
...
Recurrent connections: more complicated but also cause a series of connections
Static input leads to static output, but if there is feedback, dynamic output occurs
...
g
...
Jordan (1986)
6th December (29
...
Elman (1990)
He was interested in the same thing, but have feedback from hidden layer of connections
...
The hidden layer can feedback and it make a context for the next action, even though we
don’t have control over its activity
...
Therefore this alters output, as input is altered
...
Simple extension of feedforward architecture
...
This doesn’t explain single trial learning
...
Back-propagation algorithm is not biologically plausible due to the requirement of non-local
information from neurons (might be resolved by using more plausible algorithms e
...
, reinforcement
learning)
...
Normally used for static pattern completion, due to the symmetrical connections
...
When learning symmetric weights (Hebbian rule for standard Hopfield network for static pattern
completion):
wji → wji + εSpiSpj
6th December (29
...
‘Hebbian’ rule including increase for pre- then postsynaptic activation (plausible over short timescales, e
...
< 100 ms):
This is not entirely biologically implausible, there is something called spike time independent plasticity
...
If the presynaptic neuron’s activity is followed by activity in postsynaptic neurons, then the change in synapse is positive
...
e
...
So the
Hebbian rule is not as simple as having two neurons fire together, timing plays a large role
...
the graph shows a sequence of actions
...
11)
Simple modification to the static pattern associator
...
Can do fixed association of small number of elements in order, learning of stereotypical action
sequences, e
...
‘central pattern generators’ (controlling muscle contractions in walking, swimming,
and heartbeat etc
...
Providing neural “clocks” or “counters” (Amit 1988)
Shortcomings of Hopfield Serial Learning
Patterns must be uncorrelated
...
Fundamental problems for chaining models (Lashley 1951)
What happens when there is a repeat? E
...
spelling out ‘every’
...
Also,
chains representing the spoken word, ‘cat’, ‘tack’ and ‘act’
...
So different conflicting orders have to be learnt
...
There is
a different representation of the same action occurring in different contexts
...
The context-specific coding is not how the brain solves the problem
...
g
...
A typical error is a transposition error,
i
...
‘3, 4, 1, 2, 0’
...
This
doesn’t fit well with association chaining model
...
e
...
Competitive queuing
A special mechanisms for the representation of time/serial position and for the serial selection of actions
(Grossberg 1978; Houghton, 1990)
...
11)
Houghton thought that perception is parallel and the brain can process information in parallel, but action is
constrained to be serial
...
g
...
There is competition between the two ideas, perception of tea and cake
are mirrored in neurons (grey) and they compete with each other
...
But then there is feedback inhibition from the tea neuron,
so the ‘tea’ neuron gets inhibited
...
But
then that receives inhibitory feedback neurons too and ‘tea’ neuron wins again and vice versa
...
E
...
cat, tact and act
...
e
...
And these sounds are connected
by competitive filter, so the most active unit wins, and perform the
associated action, then the active unit is suppressed
...
Dynamic control signal
Can learn to deal with repeats
...
E
...
spelling ‘every’
...
And this could be done by associative chaining
...
When the context signal is replayed the item units are reactivated in the order they
were perceived
...
g
...
You can see a clear pattern of activation and deactivation
...
It’s not that E will lead us back to N, in fact
whatever is stopping N firing (by some temporary noise or something), N is still going to be the most active
neuron, it is waiting to win the competition even more so now that it’s been missed out
...
6th December (29
...
g
...
Can manage different sequences of the same items
...
Competitive filter fits well with more general requirement for action selection
...
2002
Primates learn to draw shapes, each different line has a
different activity in the prefrontal cortex
...
Even
before the primate starts to move, the different
representations of activity have an order, the first action is
the most active
...
By adding feedback connections, sequences can be learned using standard supervised learning
algorithms
...
Both these solutions implement a form of Associative Chaining
...
A competitive filter allows only one action at a time
...
Neurophysiological evidence exists for CQ in primate prefrontal cortex
Title: Serially Ordered Actions
Description: Computational Neuroscience- How the brain codes for serially ordered actions Lecture notes by Professor Neil Burgess at UCL for the course computational neuroscience module for neuroscience BSc (3rd year)
Description: Computational Neuroscience- How the brain codes for serially ordered actions Lecture notes by Professor Neil Burgess at UCL for the course computational neuroscience module for neuroscience BSc (3rd year)