The exibility of models of recognition memory: An analysis by the minimum-description length principle

Ten continuous, discrete, and hybrid models of recognition memory are considered in the traditional paradigm with manipulation of response bias via baserates or payoff schedules. We present an efficient method for computing the Fisher information approximation (FIA) to the normalized maximum likelihood index (NML) for these models, and a relatively efficient method for computing NML itself. This leads to a comparative evaluation of the complexity of the different models from the minimum-description-length perspective. Furthermore, we evaluate the goodness of the approximation of FIA to NML. Finally, model-recovery studies reveal that use of the minimum-description-length principle consistently identifies the true model more frequently than AIC and BIC. These results should be useful for research in recognition memory, but also in other fields (such as perception, reasoning, working memory, and so forth) in which these models play a role.
Highlights
► The Fisher information approximation is efficiently computed for ten memory models. ► A relatively general method to compute the normalized maximum likelihood is derived. ► The relative complexity of ten recognition-memory models is evaluated. ► The small-sample adequacy of the Fisher information approximation is evaluated. ► The minimum-description length indices outperform AIC and BIC in model recovery.