I'm in the process of creating a simple contrast staircase function where subjects are initially presented with high-contrast Gabor patches and are subsequently queried as to their orientation in a forced-choice task.
I only understand staircase functions superficially, which is to say that I conceive them as follows:
- present a stimulus
- query some feature of the stimulus
- If correct, reduce the intensity of the stimulus by
n, else increase its intensity by
m < n.
Intuitively, it seems like this should converge on a hit-rate of .5, but I know for a fact that a staircase can be designed to converge on an arbitrary hit-rate. How would I modify my simplistic algorithm to converge on, say, .8 ?