p011fig01.07 The choice of signal function f determines how an initial activity pattern will be transformed and stored in short-term memory (STM). Among [same, slower, faster]-than-linear signal functions, only the last one can suppress noise. It does so as it chooses the population that receives the largest input for storage, while suppressing the activities of all other population, thereby giving rise to a winner-take-all choice.
|| initial pattern (xi(0) vs i):
f | Xi(∞)= xi(∞)/sum[j: xj(∞)] | x(∞) |
linear | perfect storage of any pattern | amplifies noise (or no storage) |
slower-than-linear | saturates | amplifies noise |
faster-than-linear | chooses max [winner-take-all, Bayesian], categorical perception | suppresses noise, [normalizes, quantizes] total activity, finite state machine |