Week 10: flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

List of stuff we learned with models (7)

A
  1. Spinal cord (HH)
  2. WM (IF)
  3. HD (Rate)
  4. Hopfield network, memory matrices, spatial memory models (connecitonist neurons)
  5. Learning rules (Hebbian, competitive, BCM)
  6. Perceptron (supervised learning)
  7. Reinforcement learning (Q-learning, TD learning, model-based)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Marr’s 3 levels

Example to introduce framework of Marr’s 3 levels is trying to understand a computer do arithmetic? (3) understand at 3 levels

A
  1. Computational level
  2. Algorthmic level
  3. Implmenation level
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

At computational level to try and understand how a computer does an arithmetic

A

How do Arithmetic like a+b = c

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

At algorithim to try and understand how a computer does an arithmetic (2)

A

like particularly way we cast the problem and solve it

000100101 + 00111101 = 01101101

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

At implementation level to try and understand how a computer does an arithmetic (2)

A

How does it implement the solution in hardware like transistors on chips on computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

David Marr originally proposed 4 levels but

A

levels 3 and 4 a commonly combined

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Marr wrote 3 extremely influential (still today)

A

papers on cortex, cerebellum, hippocampus and influential theory of vision

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Marr’s 3 levels can be used to classify

A

the models we learned in the model

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Marr’s 3 levels applied to lamprey locomotor
Lamprey locomotor network focuses on

A

how does the lamprey spinal cord control swimming (generating a travelling wave of muscle activation)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Marr’s 3 levels applied to lamprey locomotor

Computational level problem

A

Has to generate rhythmic activity with a delay between spinal cord segments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Marr’s 3 levels applied to lamprey locomotor

Algorithmic level

A

We use coupled osciliators to do this

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

There is multiple realisability at algorthmic and implenetation level meaning (2)

A

More than one algortihm can exist for a given computaiton
More than one implementaiton can exist for a given algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Marr’s 3 levels
Algorithm level = couples osilicators for lamprey locomotor

Example of ‘meaning’ flashcard (more than 2 algorithms for a given computation, more than one implementaiton can exist for a given algorithm)

Two ways of producing generating osciliations at algortthmic level (3)

A

Two ways of producing osciliations at algorithmic level
* Escape from inhbition (w3)
* Alternating we could have instrinic osciliations with bursting neurons (neurons fire a burst of spikes and shut down on their own)
*

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Marr’s 3 levels
Algorithm level = couples osilicators for lamprey locomotor

Example of ‘meaning’ flashcard (more than 2 algorithms for a given computation, more than one implementaiton can exist for a given algorithm)

Two ways of producing generating osciliations at algortthmic level = how do we decide which one is a better model? (3)

A

With experiments! Cut the connection between hemi-segments in fictive locomotion experiment.

Are we still get osciliations? Are they still bursting?

If we do then might suggest we have individual bursting capability in hemi-segment

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Marr’s 3 levels

Example of ‘meaning’ flashcard (more than 2 algorithms for a given computation, more than one implementaiton can exist for a given algorithm)

Example: multiple ways of generating osciliations at implementation level (4)

A
  • Escape from inhbition
  • Vary type of inhbition between two sides = Glycinergic or Gabaergic inhbition
  • OR
  • For instrinic osilications (if we chose that algorithm) we could have instrinic osciliations with bursting neurons, with ion channel config 1; instrinic osciliations with bursting neurons with ion channel config 2 (more than one congif of ionic channels can lead to bursting)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How to decide the multiple ways to producing osciliations at implementation level for instance for lamprey locomotor network?

A

With experiments, record the ion channels, check if there is sAPH and which channel is responsible etc..

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

When you model, what is considered implentation level (in real brain) is in part (2)

A

determined by your chosen model

You can not model ion channels with IF neurons but yu could (within the scope of the model) say something about the implementation level

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Spike-frequency adapation mechanism recap (4)

A
  1. Spike-frequency adapation interval without spikes becomes larger with time
  2. Fewer inhbitatory APs arrive at contra-lateral side
  3. Other side has time to be active and inhbiti previously active side
  4. Escape from inhbition
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Spike-frequency adapation due to

A

sAPH which is consequence of Ca+ flowing in each AP and Ca trigger activation of KCa which is hyerpolarising so harder for next spike to be emitted

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Example: Marr’s 3 levels applied to WM
Quesiton is

A

How does the brian generate/implement WM?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Example Marr’s 3 levels to WM
Computational level

A

Maintain information in population of neurons on short time scales

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

Example Marr’s 3 levels to WM
We can think of two algorithms

A

One with oscilaitions (e.g., Lisman-Idiart model) vs attractors (persistent activity = cell maintain own activity level via recurrent conenctions)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Example Marr’s 3 levels to WM
Implenetation levels for osciliation based WM (3)

A

Idiart and Lisman: Specific osciliations where they come from, underpinning terms of ionic channels, ADP
OR
Various possible attractor network implenets = similar to ring attractor entworks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Marr’s 3 levels of HD
Computational Level:

A

How does the brain generate head-direction?

25
Q

Marr’s 3 levels of HD
Algorithm level (2)

A

Had ring attractor =excit and inhbit connections violation of Dale’s principles states single neuron has either excit or inhbitatory

So this model good at algorithm but not implenetation as violates this principle

26
Q

Marr’s 3 levels
HD
Different Implenetation level (2)

A
  • Could have 3 rings separating excitatory and inhbitatory connections (Excit ring project to inhbi ring and project back)
  • OR 2 ring OR 1
27
Q

What do Marr’s 3 levels mean for modelling? (3)

A
  • a model does not capture all 3 levels to be useful!
  • We can have a model that captures the algorithmic level but stays agnostic with regard to implementation
  • We can have a model that provides a correct algorithmic account but is wrong with regards to mechanism at level of implementation
28
Q

The neuron is the (building blocks to create a causal mechanism) - (3)

A
  • Basic structural unit of the brain
  • Basic functional unit of the brian
  • Neurons form networks, interact via synapses
29
Q

Neurons’ casual mechanism (2)

A
  • Chain of processing through neural networks
  • At which eventually lead to cognition and motor output
30
Q

If we want to define this concept then

A

neural mechanism is a structure of casually interacting elements specified in terms of constituents of the brain and their interactions

31
Q

If we want to make (mechanistic) models of brain function we need (2)

A

models, and connect them to casually interacting networks

Be aware all mdoels are simplifcaitons

32
Q

A neural representation is

A

a specific way of coding information (e.g., location, direction)

33
Q

Example of neural representation

A

HD tuning curve, Place cell red dots, grid cell

34
Q

Neural computation is

A

mapping between neural representations

35
Q

Example of neural computation

A

The synaptic weights between BVC and PCs ‘compute’ PCs (output ) from BVC input

36
Q

Braitenberg Vehicles (3)

A
  • Type of model
  • Not for predicitng measurement
  • Tools for thinking about the brain
37
Q

Braittenburg vehicles help make sense of

A

whole modelling enterprise

38
Q

A brain (or more abstractly a control mechanism) is essential for

A

gudiing “the vehicle” and produce adaptive behaviour

39
Q

Braitenburg was inspired by

A

Nobert Wiener (a key foundational influence on Cybernetics - study of goal-directed mechanism, formalising the notion of feedback

40
Q

Vehicle 1 which has a

A

Sensor directly conneected to the motor

41
Q

In Vehicle 1 properities (3)

A

The sensor drives the motor
The strength of the signal to the motor depend on the intensity of sensory signal
Say, the sensor senses the concentration of nutrients, or oxygen, or the intensity of light

42
Q

In Vehicle 1 linear relationship between

A

motor signal and sensor signal

43
Q

How might Vehicle 1 move? (3)

A
  • Vehicle move faster when light intensity increases (fast)
  • Speed up and slow down randomly according to sensory signal
  • It might change direction due to external forces but not of its own volition
44
Q

How do we interpret motion of Vehicle 1 (2)

A
  • Seem to dislike bright light
  • Afraid of being discovered and seeks darkness to remain hidden
45
Q

Vehicle 2 produced from

A

some mutation durign self-duplication or fusion two type 1 vehicles are joined

46
Q

Vehicle 2 can have - (3)

A
  • Ipi-lateral connections (A)
  • Contra-lateral connections (B)
  • Both (c) = same as V1
47
Q

How vehicle 2 move?
If vehicles 2A and 2B within the vincinitt of source (5)

A

V2a will avoid the source (the wheel closer to itis more strongly driven
V2b will approach the source (the wheel closer to itreceives less drive than the other)
V2a and V2b dislike sources (both hit them hard if coming a source straight on)
But V2a is a ‘coward’
V2b is ‘aggressive’

48
Q

Vehicle 3 of adding

A

different ‘neuro transmitter’ => (implying) change the positive connection from sensory to a negative inhbitatory connection

49
Q

How does vehicle 3 move? (2)

A

V3a approaches the source and comes to rest near it - it ‘adores’ the source

V3b comes to rest facing away from the sourceand any small perturbation (a flash of light) will lead it away – it’s an ‘explorer’

50
Q

In vehicle 3 the more motor signal obtained from vehicles

A

less sensory signal output you get

51
Q

Vehicle 3C which

A

combines 4 types of sensors

52
Q

What types of sensors does Vehicle 3C have? (4)

A

Light (+ uncrossed)
Temperature (+ crossed)
Oxygen (- crossed)
Nutrient density (- uncrossed)

53
Q

What behaviour does vehicle 3C manifest? (3)

A

It dislikes heat (turns away from hot places)
It hates light bulbs and attacks them head on
It prefers well-oxygenated areas (slows down) and areas rich in nutrients (if both are low, it speeds up to get out of there

54
Q

May be tempted for vehicle 3C to ascribe the

A

values or goals

55
Q

Up to vehicles 1,2,3, 3C we had sensory of this kind: (4)

A
  • more/of X the faster/slower the wheels turn
  • More sensor signal less motor signal
  • More motor signal more sensory signal
  • Oddly limiting so maybe more up to some point then less = vehicle 4A (introduce non-linear mapping)
56
Q

In Vehicle 4 we (3)

A
  • observe a multitidue of interesting behaviour in agents like Vehicle 4a like complex trajectory (Vehicle 4a moving like figure 8 around light source
  • Especially combined with properities of vehicle 3c
  • As well as other motor dependencies
57
Q

We can add threshold to sensors in vehicle 4A which (4)

A

introduce sudden onsets of behaviour

Some input from sensor but vehicle does not do anything but at a given intensity the vehicle moves in a given direction = either instantly at given voltage or slowly ramping up or slow increase, plateau then nothing if intensity gets intense

They look like ‘decisions’ , if decisions being made we may be tempted that these vehicles have some form of “will”

Or they need to integrate stimulus over time to get moving (need convincing)

58
Q

What does it all mean in Braitenburg vehicles? (6)

A

We have discovered that with very simple rules – by combining only a few – we can create vehicle with wonderfully complex behaviour.

We understand their behaviour as a consequence of their simple internal workings

But what if we didn’t know about their internal workings? Their behaviour still looks complex.

We might be tempted to assume complex mechanism underneath!

Braitenberg suggests called this: The law of uphill analysis and downhill invention (so downhill is building something then figure out what it can do, if you don’t how it is made then hard to analysis = uphill analysis)

Guessing from the outside is hard => When we analyse a mechanism from the outside we tend to overestimate its complexity

Going through the internal workings and playing out behaviours (even if initially unexpected) is much easier.