Hostname: page-component-8448b6f56d-42gr6 Total loading time: 0 Render date: 2024-04-23T06:09:23.664Z Has data issue: false hasContentIssue false

Generalization, similarity, and Bayesian inference

Published online by Cambridge University Press:  20 August 2002

Joshua B. Tenenbaum
Affiliation:
Department of Psychology, Stanford University, Stanford, CA 94305-2130 jbt@psych.stanford.edu http://www-psych.stanford.edu/~jbt
Thomas L. Griffiths
Affiliation:
Department of Psychology, Stanford University, Stanford, CA 94305-2130 gruffydd@psych.stanford.edu http://www-psych.stanford.edu/~gruffydd/

Abstract

Shepard has argued that a universal law should govern generalization across different domains of perception and cognition, as well as across organisms from different species or even different planets. Starting with some basic assumptions about natural kinds, he derived an exponential decay function as the form of the universal generalization gradient, which accords strikingly well with a wide range of empirical data. However, his original formulation applied only to the ideal case of generalization from a single encountered stimulus to a single novel stimulus, and for stimuli that can be represented as points in a continuous metric psychological space. Here we recast Shepard's theory in a more general Bayesian framework and show how this naturally extends his approach to the more realistic situation of generalizing from multiple consequential stimuli with arbitrary representational structure. Our framework also subsumes a version of Tversky's set-theoretic model of similarity, which is conventionally thought of as the primary alternative to Shepard's continuous metric space model of similarity and generalization. This unification allows us not only to draw deep parallels between the set-theoretic and spatial approaches, but also to significantly advance the explanatory power of set-theoretic models.

Type
Research Article
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)