Two-alternative forced choice

From Infogalactic: the planetary knowledge core
Jump to: navigation, search

Two-alternative forced choice (2AFC) (and the variant Two-interval forced choice (2IFC)) Task is a psychophysical method, developed by Gustav Theodor Fechner,[1] for eliciting responses from a person about his or her experiences of a stimulus. Specifically, the 2AFC experimental design is commonly used to test speed and accuracy of choices between two alternatives given a timed interval. The task is an established controlled measure of choice and is widely used to test a range of choice behaviors in animals and in humans. The basic components of a 2AFC task are 1) two alternative choices presented simultaneously (e.g. two visual stimuli), 2) a delay interval to allow a response/choice, 3) a response indicating choice of one of the stimuli.

Behavioural Experiments with 2AFC

There are various manipulations in the design of the task, engineered to test specific behavioral dynamics of choice. In one well known experiment of attention that examines the attentional shift, the Posner Cueing Task uses a 2AFC design to present two stimuli representing two given locations.[2] In this design there is an arrow that cues which stimulus (location) to attend to. The person then has to make a response between the two stimuli (locations) when prompted. In animals, the 2AFC task has been used to test reinforcement probability learning, for example such as choices in pigeons after reinforcement of trials.[3] A 2AFC task has also been designed to test decision making and the interaction of reward and probability learning in monkeys.[4]

File:Random Dot Kinematogram (Elliptical).gif
Example of a random dot kinetogram as used in a 2AFC task.

Monkeys were trained to look at a center stimulus and were then presented with two salient stimuli side by side. A response can then be made in the form of a saccade to the left or to the right stimulus. A juice reward is then administered after each response. The amount of juice reward is then varied to modulate choice.

In a different application, the 2AFC is designed to test discrimination of motion perception. The random dot motion coherence task, introduces a random dot kinetogram, with a percentage of net coherent motion distributed across the random dots.[5][6] The percentage of dots moving together in a given direction determines the coherence of motion towards the direction. In most experiments, the participant must make a choice response between two directions of motion (e.g. up or down), usually indicated by a motor response such as a saccade or pressing a button.

Biases in decision making

It is possible to introduce biases in decision making in the 2AFC task. For example, if one stimulus occurs with more frequency than the other, then the frequency of exposure to the stimuli may influence the participant's beliefs about the probability of the occurrence of the alternatives.[4][7] Introducing biases in the 2AFC task is used to modulate decision making and examine the underlying processes.

Computational models of decision making in 2AFC

The 2AFC task has yielded consistent behavioral results on decision making, which lead to the development of formal models attempting to model the dynamics of decision making. [8][9][10][11][12][13][14][15][16][17]

There are typically three assumptions made by computational models using the 2AFC:<templatestyles src="Template:Blockquote/styles.css" />

i) evidence favoring each alternative is integrated over time; ii) the process is subject to random fluctuations; and iii) the decision is made when sufficient evidence has accumulated favoring one alternative over the other.

— Bogacz et al., The Physics of Optimal Decision Making[7]

It is typically assumed that the difference in evidence favoring each alternative is the quantity tracked over time and that which ultimately informs the decision - however, evidence for different alternatives could be tracked separately.[7]

Drift-Diffusion Model

File:Drift Diffusion Model Unbiased Source Decision Making Examples.png
Example of six evidence accumulation sequences from an unbiased (100% noise) source. The dotted lines indicate the thresholds for decision making for each of the two alternatives.

The Drift Diffusion Model (DDM) is a well defined [18] model, that provably implements an optimum decision procedure for 2AFC.[19] It is the continuous analog of a Random walk model.[7] The DDM assumes that in a 2AFC task, the subject is accumulating evidence for one or other of the alternatives at each time step, and integrating that evidence until a decision threshold is reached. As the sensory input which constitutes the evidence is noisy, the accumulation to the threshold is stochastic rather than deterministic - this gives rise to the directed Random walk like behavior. The DDM has been shown to describe accuracy and reaction times in human data for 2AFC tasks.[13][18]

Formal Model

File:Drift Diffusion Model Accumulation to Threshold Example Graphs.png
Example of ten evidence accumulation sequences for the DDM, where the true result is assigned to the upper threshold. Due to the addition of noise, one sequence has produced an inaccurate decision.

The accumulation of evidence in the DDM is governed according to the following formula:

dx = Adt + cdW\ ,\ x(0) = 0 [7]

At time zero, the evidence accumulated, x, is set equal to zero. At each time step, some evidence, A, is accumulated for one of the two possibilities in the 2AFC. A is positive if the correct response is represented by the upper threshold, and negative if the lower. In addition, a noise term, cdW, is added to represent noise in input. On average, the noise will integrate to zero.[7] The extended DDM[13] allows for selection of A and the starting value of x(0) from separate distributions - this provides a better fit to experimental data for both accuracy and reaction times.[20] [21]

Other models

Ornstein-Uhlenbeck model

The Ornstein-Uhlenbeck model[14] extends the DDM by adding another term, \lambda, to the accumulation that is dependent on the current accumulation of evidence - this has the net effect of increasing the rate of accumulation towards the initially preferred option.

dx\ =\ (\lambda x + A)dt\ +\ cdW [7]

Race Model

In the race model,[11][12][22] evidence for each alternative is accumulated separately, and a decision made either when one of the accumulators reaches a predetermined threshold, or when a decision is forced and then the decision associated with the accumulator with the highest evidence is chosen. This can be represented formally by:

\begin{align}dy_{\text{1}}\ =\ I_{\text{1}}dt\ +\ cdW_{\text{1}}\\
dy_{\text{2}}\ =\ I_{\text{2}}dt\ +\ cdW_{\text{2}}\end{align},\quad y_{\text{1}}(0)\ =\ y_{\text{2}}(0) = 0[7]

The race model is not mathematically reducible to the DDM,[7] and hence cannot be used to implement an optimal decision procedure.

Mutual Inhibition Model

The Mutual Inhibition model [16] also uses two accumulators to model the accumulation of evidence, as with the race model. In this model the two accumulators have an inhibitory effect on each other, so as evidence is accumulated in one, it dampens the accumulation of evidence in the other. In addition, leaky accumulators are used, so that over time evidence accumulated decays - this helps to prevent runaway accumulation towards one alternative based on a short run of evidence in one direction. Formally, this can be shown as:

\begin{align}dy_{\text{1}}\ =\ (-ky_{\text{1}}-wy_{\text{2}}+I_{\text{1}})dt\ +\ cdW_{\text{1}}\\
dy_{\text{2}}\ =\ (-ky_{\text{2}}-wy_{\text{1}}+I_{\text{2}})dt\ +\ cdW_{\text{2}}\end{align},\quad y_{\text{1}}(0)\ =\ y_{\text{2}}(0) = 0[7]

Where k is a shared decay rate of the accumulators, and w is the rate of mutual inhibition.

Feedforward Inhibition Model

The Feedforward Inhibition model [23] is similar to the mutual inhibition model, but instead of being inhibited by the current value of the other accumulator, each accumulator is inhibited by a fraction of the input to the other. It can be formally stated thus:

\begin{align}dy_{\text{1}}\ =\ I_{\text{1}}dt\ +\ cdW_{\text{1}}\ -\ u(I_{\text{2}}dt\ +\ cdW_{\text{2}})\\
dy_{\text{2}}\ =\ I_{\text{2}}dt\ +\ cdW_{\text{2}}\ -\ u(I_{\text{1}}dt\ +\ cdW_{\text{1}})\end{align},\quad y_{\text{1}}(0)\ =\ y_{\text{2}}(0) = 0[7]

Where u is the fraction of accumulator input that inhibits the alternate accumulator.

Pooled Inhibition Model

Wang[24] suggested the Pooled Inhibition model, where a third, decaying accumulator is driven by accumulation in both of the accumulators used for decision making, and in addition to the decay used in the mutual inhibition model, each of the decision driving accumulators self-reinforce based on their current value. It can be formally stated thus:

\begin{align}dy_{\text{1}}\ =\ (-ky_{\text{1}}-wy_{\text{3}}+vy_{\text{1}}+I_{\text{1}})dt\ +\ cdW_{\text{1}}\\
dy_{\text{2}}\ =\ (-ky_{\text{2}}-wy_{\text{3}}+vy_{\text{2}}+I_{\text{2}})dt\ +\ cdW_{\text{2}}\\ dy_{\text{3}}\ =\ (-k_{\text{inh}}y_{\text{3}}+w'(y_{\text{1}}+y_{\text{2}}))dt\end{align}[7]

The third accumulator has an independent decay coefficient, k_{\text{inh}}, and increases based on the current values of the other two accumulators, at a rate modulated by w'.

Neural correlates of decision making in 2AFC

Brain Areas

In the parietal lobe, lateral intraparietal cortex (LIP) neuron firing rate in monkeys predicted the choice response of direction of motion suggesting this area is involved in decision making in the 2AFC.[4][23][25]

Neural data recorded from LIP neurons in rhesus monkeys supports the DDM, as firing rates for the direction selective neuronal populations sensitive to the two directions used in the 2AFC task increase firing rates at stimulus onset, and average activity in the neuronal populations is biased in the direction of the correct response.[23][26][27][28] In addition, it appears that a fixed threshold of neuronal spiking rate is used as the decision boundary for each 2AFC task.[29]

See also

References

  1. Lua error in package.lua at line 80: module 'strict' not found. Vol 2.
  2. Lua error in package.lua at line 80: module 'strict' not found.
  3. Lua error in package.lua at line 80: module 'strict' not found.
  4. 4.0 4.1 4.2 Lua error in package.lua at line 80: module 'strict' not found.
  5. Lua error in package.lua at line 80: module 'strict' not found.
  6. Lua error in package.lua at line 80: module 'strict' not found.
  7. 7.00 7.01 7.02 7.03 7.04 7.05 7.06 7.07 7.08 7.09 7.10 7.11 Lua error in package.lua at line 80: module 'strict' not found.
  8. Lua error in package.lua at line 80: module 'strict' not found.
  9. Lua error in package.lua at line 80: module 'strict' not found.
  10. Lua error in package.lua at line 80: module 'strict' not found.
  11. 11.0 11.1 Lua error in package.lua at line 80: module 'strict' not found.
  12. 12.0 12.1 Lua error in package.lua at line 80: module 'strict' not found.
  13. 13.0 13.1 13.2 Lua error in package.lua at line 80: module 'strict' not found.
  14. 14.0 14.1 Lua error in package.lua at line 80: module 'strict' not found.
  15. Lua error in package.lua at line 80: module 'strict' not found.
  16. 16.0 16.1 Lua error in package.lua at line 80: module 'strict' not found.
  17. Lua error in package.lua at line 80: module 'strict' not found.
  18. 18.0 18.1 Lua error in package.lua at line 80: module 'strict' not found.
  19. Lua error in package.lua at line 80: module 'strict' not found.
  20. Lua error in package.lua at line 80: module 'strict' not found.
  21. Lua error in package.lua at line 80: module 'strict' not found.
  22. Lua error in package.lua at line 80: module 'strict' not found.
  23. 23.0 23.1 23.2 Lua error in package.lua at line 80: module 'strict' not found.
  24. Lua error in package.lua at line 80: module 'strict' not found.
  25. Lua error in package.lua at line 80: module 'strict' not found.
  26. Lua error in package.lua at line 80: module 'strict' not found.
  27. Lua error in package.lua at line 80: module 'strict' not found.
  28. Lua error in package.lua at line 80: module 'strict' not found.
  29. Lua error in package.lua at line 80: module 'strict' not found.