## Rational approximations to rational models: Alternative algorithms for category learning

Citations: | 20 - 4 self |

### BibTeX

@MISC{Sanborn_rationalapproximations,

author = {Adam N. Sanborn and Thomas L. Griffiths and Daniel J. Navarro and Adam Sanborn},

title = { Rational approximations to rational models: Alternative algorithms for category learning},

year = {}

}

### OpenURL

### Abstract

Rational models of cognition typically consider the abstract computational problems posed by the environment, assuming that people are capable of optimally solving those problems. This differs from more traditional formal models of cognition, which focus on the psychological processes responsible for behavior. A basic challenge for rational models is thus explaining how optimal solutions can be approximated by psychological processes. We outline a general strategy for answering this question, namely to explore the psychological plausibility of approximation algorithms developed in computer science and statistics. In particular, we argue that Monte Carlo methods provide a source of “rational process models” that connect optimal solutions to psychological processes. We support this argument through a detailed example, applying this approach to Anderson’s (1990, 1991) Rational Model of Categorization (RMC), which involves a particularly challenging computational problem. Drawing on a connection between the RMC and ideas from nonparametric Bayesian statistics, we propose two alternative algorithms for approximate inference in this model. The algorithms we consider include Gibbs sampling, a procedure