Human knowledge is organized hierarchically into levels of abstraction. For instance, the most common or basic-level categories (e.g. dog, car) can be thought of as abstractions across individuals, or more often across subordinate categories (e.g., poodle, Dalmatian, Labrador, and so on). Multiple basic-level categories in turn can be organized under superordinate categories: e.g., dog, cat, horse are all animals; car, truck, bus are all vehicles. Some of the deepest questions of cognitive development are: How does abstract knowledge influence learning of specific knowledge? How can abstract knowledge be learned? In this section we will see how such hierarchical knowledge can be modeled with hierarchical generative models: generative models with uncertainty at several levels, where lower levels depend on choices at higher levels.
Hierarchical models allow us to capture the shared latent structure underlying observations of multiple related concepts, processes, or systems – to abstract out the elements in common to the different sub-concepts, and to filter away uninteresting or irrelevant differences. Perhaps the most familiar example of this problem occurs in learning about categories. Consider a child learning about a basic-level kind, such as dog or car. Each of these kinds has a prototype or set of characteristic features, and our question here is simply how that prototype is acquired.
The task is challenging because real-world categories are not homogeneous. A basic-level category like dog or car actually spans many different subtypes: e.g., poodle, Dalmatian, Labrador, and such, or sedan, coupe, convertible, wagon, and so on. The child observes examples of these sub-kinds or subordinate-level categories: a few poodles, one Dalmatian, three Labradors, etc. From this data she must infer what it means to be a dog in general, in addition to what each of these different kinds of dog is like. Knowledge about the prototype level includes understanding what it means to be a prototypical dog and what it means to be non-prototypical, but still a dog. This will involve understanding that dogs come in different breeds which share features between them, but also differ systematically as well.
As a simplification of this situation consider the following generative process. We will draw marbles out of several different bags. There are five marble colors. Each bag has a certain “prototypical” mixture of colors. This generative process is represented in the following Church example using the Dirichlet distribution (the Dirichlet is the higher-dimensional analogue of the Beta distribution).
(define colors '(black blue green orange red)) (define bag->prototype (mem (lambda (bag) (dirichlet '(1 1 1 1 1))))) (define (draw-marbles bag num-draws) (repeat num-draws (lambda () (multinomial colors (bag->prototype bag))))) (hist (draw-marbles 'bag 50) "first sample") (hist (draw-marbles 'bag 50) "second sample") (hist (draw-marbles 'bag 50) "third sample") (hist (draw-marbles 'bag 50) "fourth sample") 'done
Note that we are using the operator
mem that we introduced in the first part of the tutorial.
mem is particularly useful when writing hierarchical models because it allows us to associate arbitrary random draws with categories across entire runs of the program. In this case it allows us to associate a particular mixture of marble colors with each bag. The mixture is drawn once, and then remains the same thereafter for that bag.
Run the code above multiple times. Each run creates a single bag of marbles with its characteristic distribution of marble colors, and then draws four samples of 50 marbles each. Intuitively, you can see how each sample is sufficient to learn a lot about what that bag is like; there is typically a fair amount of similarity between the empirical color distributions in each of the four samples from a given bag. In contrast, you should see a lot more variation across different runs of the code – samples from different bags.
Now let’s add a few twists: we will generate three different bags, and try to learn about their respective color prototypes by conditioning on observations. We represent the results of learning in terms of the posterior predictive distribution for each bag: a single hypothetical draw from the bag, using the expression
(draw-marble 'bag). We will also draw a sample from the posterior predictive distribution on a new bag, for which we have had no observations.
(define colors '(black blue green orange red)) (define samples (mh-query 200 100 (define bag->prototype (mem (lambda (bag) (dirichlet '(1 1 1 1 1))))) (define (draw-marble bag) (multinomial colors (bag->prototype bag))) (define (observe-bag bag values) (map (lambda (v) (condition (equal? (multinomial colors (bag->prototype bag)) v))) values)) ;;predict the next sample from each observed bag, and a new one: (list (draw-marble 'bag-1) (draw-marble 'bag-2) (draw-marble 'bag-3) (draw-marble 'bag-n)) ;;condition on observations from three bags: (observe-bag 'bag-1 '(blue blue black blue blue blue)) (observe-bag 'bag-2 '(blue green blue blue blue red)) (observe-bag 'bag-3 '(blue blue blue blue blue orange)))) samples (hist (map first samples) "bag one posterior predictive") (hist (map second samples) "bag two posterior predictive") (hist (map third samples) "bag three posterior predictive") (hist (map fourth samples) "bag n posterior predictive") 'done
This generative model describes the prototype mixtures in each bag, but it does not attempt learn a common higher-order prototype. It is like learning separate prototypes for subordinate classes poodle, Dalmatian, and Labrador, without learning a prototype for the higher-level kind dog—or learning about any functions that are shared across the different lower-level classes or bags. Specifically, inference suggests that each bag is predominantly blue, but with a fair amount of residual uncertainty about what other colors might be seen. There is no information shared across bags, and nothing significant is learned about
bag-n as it has no observations and no structure shared with the bags that have been observed.
Now let us introduce another level of abstraction: a global prototype that provides a prior on the specific prototype mixtures of each bag.
(define colors '(black blue green orange red)) (define samples (mh-query 200 100 ;;we make a global prototype which is a dirichlet sample scaled to total 5. (define prototype (map (lambda (x) (* 5 x)) (dirichlet '(1 1 1 1 1)))) ;;the prototype for each bag uses the global prototype as parameters. (define bag->prototype (mem (lambda (bag) (dirichlet prototype)))) (define (draw-marble bag) (multinomial colors (bag->prototype bag))) (define (observe-bag bag values) (map (lambda (v) (condition (equal? (multinomial colors (bag->prototype bag)) v))) values)) (list (draw-marble 'bag-1) (draw-marble 'bag-2) (draw-marble 'bag-3) (draw-marble 'bag-n)) ;;condition on observations from three bags: (observe-bag 'bag-1 '(blue blue black blue blue blue)) (observe-bag 'bag-2 '(blue green blue blue blue red)) (observe-bag 'bag-3 '(blue blue blue blue blue orange)))) (hist (map first samples) "bag one posterior predictive") (hist (map second samples) "bag two posterior predictive") (hist (map third samples) "bag three posterior predictive") (hist (map fourth samples) "bag n posterior predictive") 'done
Compared with inferences in the previous example, this extra level of abstraction enables faster learning: more confidence in what each bag is like based on the same observed sample. This is because all of the observed samples suggest a common prototype structure, with most of its weight on
blue and the rest of the weight spread uniformly among the remaining colors. Statisticians sometimes refer to this phenomenon of inference in hierarchical models as “sharing of statistical strength”: it is as if the sample we observe for each bag also provides a weaker indirect sample relevant to the other bags. In machine learning and cognitive science this phenomenon is often called learning to learn or transfer learning. Intuitively, knowing something about bags in general allows the learner to transfer knowledge gained from draws from one bag to other bags. This example is analogous to seeing several examples of different subtypes of dogs and learning what features are in common to the more abstract basic-level dog prototype, independent of the more idiosyncratic features of particular dog subtypes.
A particularly striking example of “sharing statistical strength” or “learning to learn” can be seen if we change the observed sample for bag 3 to have only two examples, one blue and one orange. Replace the line
(observe-bag 'bag-3 '(blue blue blue blue blue orange)) with
(observe-bag 'bag-3 '(blue orange)) in each program above. In a situation where we have no shared higher-order prototype structure, inference for bag-3 from these observations suggests that
orange are equally likely. However, when we have inferred a shared higher-order prototype, then the inferences we make for bag 3 look much more like those we made before, with six observations (five blue, one orange), because the learned higher-order prototype tells us that blue is most likely to be highly represented in any bag regardless of which other colors (here, orange) may be seen with lower probability.
Learning about shared structure at a higher level of abstraction also supports inferences about new bags without observing any examples from that bag: a hypothetical new bag could produce any color, but is likely to have more blue marbles than any other color. We can imagine hypothetical, previously unseen, new subtypes of dogs that share the basic features of dogs with more familiar kinds but may differ in some idiosyncratic ways.
Now let’s investigate the relative learning speeds at different levels of abstraction. Suppose that we have a number of bags that all have identical prototypes: they mix red and blue in proportion 2:1. But the learner doesn’t know this. She observes only one ball from each of N bags. What can she learn about an individual bag versus the population as a whole as the number of bags changes?
(define colors '(red blue)) (define (sample-bags obs-draws) (mh-query 300 100 ;;we make a global prototype which is a dirichlet sample scaled to total 2: (define phi (dirichlet '(1 1))) (define global-prototype (map (lambda (x) (* 2 x)) phi)) ;;the prototype for each bag uses the global prototype as parameters. (define bag->prototype (mem (lambda (bag) (dirichlet global-prototype)))) (define (draw-marbles bag num-draws) (repeat num-draws (lambda () (multinomial colors (bag->prototype bag))))) ;;query the inferred bag1 and global prototype: (list (first (bag->prototype (first (first obs-draws)))) (first phi)) ;;condition on getting the right observations from each bag. ;;obs-draws is a list of lists of draws from each bag (first is bag name). (all (map (lambda (bag) (equal? (rest bag) (draw-marbles (first bag) (length (rest bag))))) obs-draws)))) ;;; visualization code ;;;fold: ;;compute the mean squared deviation of samples from truth: (define colors '(red blue)) (define (sample-bags obs-draws) (mh-query 300 100 ;;we make a global prototype which is a dirichlet sample scaled to total 2: (define phi (dirichlet '(1 1))) (define global-prototype (map (lambda (x) (* 2 x)) phi)) ;;the prototype for each bag uses the global prototype as parameters. (define bag->prototype (mem (lambda (bag) (dirichlet global-prototype)))) (define (draw-marbles bag num-draws) (repeat num-draws (lambda () (multinomial colors (bag->prototype bag))))) (define (observe-bag bag values) (map (lambda (v) (condition (equal? (multinomial colors (bag->prototype bag)) v))) values)) ;;query the inferred bag1 and global prototype: (list (first (bag->prototype (first (first obs-draws)))) (first phi)) ;;condition on getting the right observations from each bag. ;;obs-draws is a list of lists of draws from each bag (first is bag name). (map (lambda (bag-and-values) (observe-bag (first bag-and-values) (rest bag-and-values))) obs-draws))) ;;; visualization code ;;;fold: ;;compute the mean squared deviation of samples from truth: (define (mean-dev truth samples) (mean (map (lambda (s) (expt (- truth s) 2)) samples))) ;;now we generate learning curves! we take a single sample from each bag. ;;plot the mean-squared error normalized by the no-observations error. (define samples (sample-bags '((bag1)))) (define initial-specific (mean-dev 0.66 (map first samples))) (define initial-global (mean-dev 0.66 (map second samples))) (define observations '((bag1 red) (bag2 red) (bag3 blue) (bag4 red) (bag5 red) (bag6 blue) (bag7 red) (bag8 red) (bag9 blue) (bag10 red) (bag11 red) (bag12 blue))) (define num-obs '(1 3 6 9 12)) (define all-samples (map (lambda (num) (sample-bags (take observations num))) num-obs)) (define mse-specific (map (lambda (samples) (/ (mean-dev 0.66 (map first samples)) initial-specific)) all-samples)) (define mse-general (map (lambda (samples) (/ (mean-dev 0.66 (map second samples)) initial-specific)) all-samples)) (lineplot (pair '(0 1) (zip num-obs mse-specific)) "specific learning") (lineplot (pair '(0 1) (zip num-obs mse-general)) "general learning") 'done
We are plotting learning curves: the mean squared error of the prototype from the true prototype for the specific level (the first bag) and the general (global prototype) level as a function of the number of observed data points. Note that these quantities are directly comparable because they are each samples from a Dirichlet distribution of the same size (this is often not the case in hierarchical models). What we see is that learning is faster at the general level than the specific level—that is that the error in the estimated prototype drops faster in the general than the specific plots. We also see that there is continued learning at the specific level, even though we see no additional samples from the first bag after the first; this is because the evolving knowledge at the general level further constrains the inferences at the specific level. Going back to our familiar categorization example, this suggests that a child could be quite confident in the prototype of “dog” while having little idea of the prototype for any specific kind of dog—learning more quickly at the abstract level than the specific level, but then using this abstract knowledge to constrain expectations about the specific level. This dynamic depends crucially on the fact that we get very diverse evidence: try changing the above example to observe the same N examples, but coming from a single bag (instead of N bags). You should now see that learning for this bag is quick, while global learning (and transfer) is slow.
The first of the plots above shows learning curves when there is one observation per bag. The second plot shows learning curves when all the observations come from the same bag.
In machine learning one often talks of the curse of dimensionality. The curse of dimensionality refers to the fact that as the number of parameters of a model increases (i.e. the dimensionality of the model increases), the size of the hypothesis space increases exponentially. This increase in the size of the hypothesis space leads to two related problems. The first is that the amount of data required to estimate model parameters (called the “sample complexity”) increases rapidly as the dimensionality of the hypothesis space increases. The second is that the amount of computational work needed to search the hypothesis space also rapidly increases. Thus, increasing model complexity by adding parameters can result in serious problems for inference.
In contrast, we have seen that adding additional levels of abstraction (and hence additional parameters) in a probabilistic model can sometimes make it possible to learn more with fewer observations. This happens because learning at the abstract level can be quicker than learning at the specific level. Because this ameliorates the curse of dimensionality, we refer to these effects as the blessing of abstraction.
In general, the blessing of abstraction can be surprising because our intuitions often suggest that adding more hierarchical levels to a model increases the model’s complexity. More complex models should make learning harder, rather than easier. On the other hand, it has long been understood in cognitive science that learning is made easier by the addition of constraints on possible hypothesis. For instance, proponents of universal grammar have long argued for a highly constrained linguistic system on the basis of learnability. Their theories often have an explicitly hierarchical flavor. Hierarchical Bayesian models can be seen as a way of introducing soft, probabilistic constraints on hypotheses that allow for the transfer of knowledge between different kinds of observations.
Hierarchical models also allow us to capture a more abstract and even more important “learning to learn” phenomenon, sometimes called learning overhypotheses. Consider how a child learns about living creatures (an example we adapt from the psychologists Liz Shipley and Rob Goldstone). We learn about specific kinds of animals – dogs, cats, horses, and more exotic creatures like elephants, ants, spiders, sparrows, eagles, dolphins, goldfish, snakes, worms, centipedes – from examples of each kind. These examples tell us what each kind is like: Dogs bark, have four legs, a tail. Cats meow, have four legs and a tail. Horses neigh, have four legs and a tail. Ants make no sound, have six legs, no tail. Robins and eagles both have two legs, wings, and a tail; robins sing while eagles cry. Dolphins have fins, a tail, and no legs; likewise for goldfish. Centipedes have a hundred legs, no tail and make no sound. And so on. Each of these generalizations or prototypes may be inferred from seeing several examples of the species.
But we also learn about what kinds of creatures are like in general. It seems that certain kinds of properties of animals are characteristic of a particular kind: either every individual of a kind has this property, or none of them have it. Characteristic properties include number of legs, having a tail or not, and making some kind of sound. If one individual in a species has four legs, or six or two or eight or a hundred legs, essentially all individuals in that species have that same number of legs (barring injury, birth defect or some other catastrophe). Other kinds of properties don’t pattern in such a characteristic way. Consider external color. Some kinds of animals are homogeneous in coloration, such as dolphins, elephants, sparrows. Others are quite heterogeneous in coloration: dogs, cats, goldfish, snakes. Still others are intermediate, with one or a few typical color patterns: horses, ants, eagles, worms.
This abstract knowledge about what animal kinds are like can be extremely useful in learning about new kinds of animals. Just one example of a new kind may suffice to infer the prototype or characteristic features of that kind: seeing a spider for the first time, and observing that it has eight legs, no tail and makes no sound, it is a good bet that other spiders will also have eight legs, no tail and make no sound. The specific coloration of the spider, however, is not necessarily going to generalize to other spiders. Although a basic statistics class might tell you that only by seeing many instances of a kind can we learn with confidence what features are constant or variable across that kind, both intuitively and empirically in children’s cognitive development it seems that this “one-shot learning” is more the norm. How can this work? Hierarchical models show us how to formalize the abstract knowledge that enables one-shot learning, and the means by which that abstract knowledge is itself acquired (Kemp, Perfors, & Tenenbaum, 2007).
We can study a simple version of this phenomenon by modifying our bags of marbles example, articulating more structure to the hierarchical model as follows. We now have two higher-level parameters:
phi describes the expected proportions of marble colors across bags of marbles, while
alpha, a real number, describes the strength of the learned prior – how strongly we expect any newly encountered bag to conform to the distribution for the population prototype
phi. For instance, suppose that we observe that
bag-1 consists of all blue marbles,
bag-2 consists of all green marbles,
bag-3 all red, and so on. This doesn’t tell us to expect a particular color in future bags, but it does suggest that bags are very regular—that all bags consist of marbles of only one color.
(define colors '(black blue green orange red)) (define samples (mh-query 200 100 ;;the global prototype mixture: (define phi (dirichlet '(1 1 1 1 1))) ;;regularity parameters: how strongly we expect the global prototype to project (ie. determine the local prototypes): (define alpha (gamma 2 2)) ;;put them together into the global parameters: (define prototype (map (lambda (w) (* alpha w)) phi)) (define bag->prototype (mem (lambda (bag) (dirichlet prototype)))) (define (draw-marble bag) (multinomial colors (bag->prototype bag))) (define (observe-bag bag values) (map (lambda (v) (condition (equal? (multinomial colors (bag->prototype bag)) v))) values)) (list (draw-marble 'bag-1) (draw-marble 'bag-2) (draw-marble 'bag-3) (draw-marble 'bag-4) (draw-marble 'bag-n) (log alpha)) (observe-bag 'bag-1 '(blue blue blue blue blue blue)) (observe-bag 'bag-2 '(green green green green green green)) (observe-bag 'bag-3 '(red red red red red red)) (observe-bag 'bag-4 '(orange)))) (hist (map first samples) "bag one posterior predictive") (hist (map second samples) "bag two posterior predictive") (hist (map third samples) "bag three posterior predictive") (hist (map fourth samples) "bag four posterior predictive") (hist (map fifth samples) "bag n posterior predictive") (hist (map sixth samples) "consistency across bags (log alpha)") 'done
This model uses the gamma distribution as a prior on the regularity parameter. Gamma is a useful continuous distribution on the non-negative numbers; here are some examples of Gamma with different parameter values:
We have queried on the mixture of colors in a fourth bag, for which only one marble has been observed (orange), and we see is very strong posterior predictive distribution focused on orange—a “one-shot” generalization. This posterior is much stronger than the single observation for that bag can justify on its own. Instead, it reflects the learned overhypothesis that bags tend to be uniform in color.
To see that this is real one-shot learning, contrast with the predictive distribution for bag-n, where we have made no observations:
bag-n gives a mostly flat distribution. Little has been learned in the hierarchical model about the specific colors represented in the overall population; rather we have learned the abstract property that bags of marbles tend to be uniform in color. Hence, a single observation from a new bag is enough to make strong predictions about that bag even though little could be said prior to seeing the first observation.
The above code shows a histogram of the inferred values of
alpha (actually, its log value), representing how strongly the prototype distribution captured in
phi constrains each individual bag—how much each individual bag is expected to look like the prototype of the population. You should see that the inferred values of
alpha are typically significantly less than 1 (or log less than 0). This means roughly that the learned prototype in
phi should exert less influence on prototype estimation for a new bag than a single observation. Hence the first observation we make for a new bag mostly determines a strong inference about what that bag is like.
Now change the conditioning statement (the data) in the above code example as follows:
(observe-bag 'bag-1 '(blue red green black red blue)) (observe-bag 'bag-2 '(green red black black blue green)) (observe-bag 'bag-3 '(red green blue blue black green)) (observe-bag 'bag-4 '(orange))
Intuitively, the observations for bags one, two and three should now suggest a very different overhypothesis: that marble color, instead of being homogeneous within bags but variable across bags, is instead variable within bags to about the same degree that it varies in the population as a whole. We can see this inference represented via two coupled effects. First, the inferred value of
alpha is now significantly greater than 1 (log value greater than 0), asserting that the population distribution as a whole,
phi, now exerts a strong constraint on what any individual bag looks like. Second, for a new
'bag-4 which has been observed only once, with a single orange marble, that draw is now no longer very influential on the color distribution we expect to see from that bag; the broad distribution in
phi exerts a much stronger influence than the single observation.
One well studied overhypothesis in cognitive development is the ‘shape bias’: the inductive bias which develops by 24 months and which is the preference to generalize a novel label for some object to other objects of the same shape, rather than say the same color or texture. Studies by Smith and colleagues (2002) have shown that this bias can be learned with very little data. They trained 17 month old children, over eight weeks, on four pairs of novel objects where the objects in each pair had the same shape but differed in color and texture and were consistently given the same novel name. First order generalization was tested by showing children an object from one of the four trained categories and asking them to choose another such object from three choice objects that matched the shown object in exactly one feature. Children preferred the shape match. Second order generalization was also tested by showing children an object from a novel category and again children preferred the choice object which matched in shape. Smith and colleagues further found an increase in real-world vocabulary as a result of this training such that children who had been trained began to use more object names. Children had thus presumably learned something like ‘shape is homogeneous within object categories’ and were able to apply this inductive bias to word learning outside the lab.
We now consider a model of learning the shape bias which uses the compound Dirichlet-multinomial model that we have been discussing in the context of bags of marbles. This model for the shape bias is from (Kemp et al., 2007). Rather than bags of marbles we now have object categories and rather than observing marbles we now observe the features of an object (e.g. its shape, color, and texture) drawn from one of the object categories. Suppose that a feature from each dimension of an object is generated independently of the other dimensions and there are separate values of alpha and phi for each dimension. Importantly, one needs to allow for more values along each dimension than appear in the training data so as to be able to generalize to novel shapes, colors, etc. To test the model we can feed it training data to allow it to learn the values for the alphas and phis corresponding to each dimension. We can then give it a single instance of some new category and then ask what the probability is that the various choice objects also come from the same new category. The church code below shows a model for the shape bias, conditioned on the same training data used in the Smith et al experiment. We can then ask both for draws from some category which we’ve seen before, and from some new category which we’ve seen a single instance of. One small difference from the previous models we’ve seen for the example case is that the alpha hyperparameter is now drawn from an exponential distribution with inverse mean 1, rather than a Gamma distribution. This is simply for consistency with the model given in the Kemp et al (2007) paper.
(define shapes (iota 11)) (define colors (iota 11)) (define textures (iota 11)) (define sizes (iota 11)) (define samples (mh-query 250 100 ;;Rather than defining variables for each dimension, we could make more use of abstraction. (define phi-shapes (dirichlet (make-list (length shapes) 1))) (define phi-colors (dirichlet (make-list (length colors) 1))) (define phi-textures (dirichlet (make-list (length textures) 1))) (define phi-sizes (dirichlet (make-list (length sizes) 1))) ;;regularity parameters: how strongly we expect the global prototype to project (ie. determine the local prototypes): (define alpha-shapes (exponential 1)) (define alpha-colors (exponential 1)) (define alpha-textures (exponential 1)) (define alpha-sizes (exponential 1)) ;;put them together into the global parameters: (define prototype-shapes (map (lambda (w) (* alpha-shapes w)) phi-shapes)) (define prototype-colors (map (lambda (w) (* alpha-colors w)) phi-colors)) (define prototype-textures (map (lambda (w) (* alpha-textures w)) phi-textures)) (define prototype-sizes (map (lambda (w) (* alpha-sizes w)) phi-sizes)) (define category->prototype (mem (lambda (bag) (list (dirichlet prototype-shapes) (dirichlet prototype-colors) (dirichlet prototype-textures) (dirichlet prototype-sizes))))) (define (draw-object category) (map (lambda (dim proto) (multinomial dim proto)) (list shapes colors textures sizes) (category->prototype category))) (define (observe-object category observed-shapes) (map (lambda (shape) (map (lambda (dim proto feature) (condition (equal? (multinomial dim proto) feature))) (list shapes colors textures sizes) (category->prototype category) shape)) observed-shapes)) (first (draw-object 'cat-5)) (observe-object 'cat-1 '((1 1 1 1) (1 2 2 2))) (observe-object 'cat-2 '((2 3 3 1) (2 4 4 2))) (observe-object 'cat-3 '((3 5 5 1) (3 6 6 2))) (observe-object 'cat-4 '((4 7 7 1) (4 8 8 2))) (observe-object 'cat-5 '((5 9 9 1))))) (hist samples "Shape of object drawn from cat-5")
The program above gives us draws from some novel category for which we’ve seen a single instance. In the experiments with children, they had to choose one of three choice objects which varied according to the dimension they matched the example object from the category. We show below model predictions (from Kemp et al (2007)) for performance on the shape bias task which show the probabilities (normalized) that the choice object belongs to the same category as the test exemplar. The model predictions reproduce the general pattern of the experimental results of Smith et al in that shape matches are preferred in both the first and second order generalization case, and more strong in the first order generalization case. The model also helps to explain the childrens’ vocabulary growth in that it shows how the shape bias can be generally learned, as seen by the differing values learned for the various alpha parameters, and so used outside the lab.
The model can be extended to learn to apply the shape bias only to the relevant ontological kinds, for example to object categories but not to substance categories. The Kemp et al (2007) paper discusses such an extension to the model which learns the hyperparameters separately for each kind and further learns what categories belong to each kind and how many kinds there are. This involves the use of a non-parametric prior, called the Chinese Restaurant Process, which will be discussed in the section on non-parametric models.
In a 1983 paper, Nisbett and colleagues (1983) examined how, and under what conditions, people made use of statistical heuristics when reasoning. One question they considered was how and when people generalized from a few instances. They showed that to what extent people generalise depends on beliefs about the homogeneity of the group that the object falls in with respect to the property they are being asked to generalize about. In one study, they asked subjects the following question:
Imagine that you are an explorer who has landed on a little known island in the Southeastern Pacific. You encounter several new animals, people, and objects. You observe the properties of your “samples” and you need to make guesses about how common these properties would be in other animals, people, or objects of the same type.
The number of encountered instances of an object were varied (one, three, or twenty instances) as well as the type and property of the objects. For example:
Suppose you encounter a native, who is a member of a tribe he calls the Barratos. He is obese. What percent of the male Barratos do you expect to be obese?
Suppose the Barratos man is brown in color. What percent of male Barratos do you expect to be brown (as opposed to red, yellow, black or white)?
Results for two questions of the experiment are shown below. The results accord both with the beliefs of the experimenters about how heterogeneous different groups would be, and subjects stated reasons for generalizing in the way they did for the different instances (which were coded for beliefs about how homogeneous objects are with respect to some property).
Again, we can use the compound Dirichlet-multinomial model we have been working with throughout to model this task, following Kemp et al (2007). In the context of the question about members of the Barratos tribe, replace bags of marbles with tribes and the color of marbles with skin color, or the property of being obese. Observing data such that skin color is consistent within tribes but varies between tribes will cause a low value of the alpha corresponding to skin color to be learned, and so seeing a single example from some new tribe will result in a sharply peaked predictive posterior distribution for the new tribe. Conversely, given data that obesity varies within a tribe the model will learn a higher value of the alpha corresponding to obesity and so will not generalize nearly as much from a single instance from a new tribe. Note that again it’s essential to have learning at the level of hyperparameters in order to capture this phenomenon. It is only by being able to learn appropriate values of the hyperparameters from observing a number of previous tribes that the model behaves reasonably when given a single observation from a new tribe.
So far, we’ve been using the compound Dirichlet-multinomial to do one shot learning, by learning low values for the alpha hyperparameter. This causes the Dirichlet distribution at the second level to have parameters less than 1, and so to be ‘spiky’. While such a Dirichlet distribution can lead to one shot learning, we’re not explicitly learning about the variance of the categories in the model. We might imagine a similar model in which we handle continuous quantities and directly represent hyperparameters for the mean and variance of various related groups.
(define results (mh-query 50 1000 (define overall-variance (gamma 1 1)) (define overall-shape (gamma 2 2)) (define overall-scale (gamma 2 2)) (define group->variance (mem (lambda (group) (gamma overall-shape overall-scale)))) (define group->mean (mem (lambda (group) (gaussian 1 overall-variance)))) (define (draw-observation group) (lambda () (gaussian (group->mean group) (group->variance group)))) (define (observe-group group values) (map (lambda (v) (condition (equal? (gaussian (group->mean group) (group->variance group)) v))) values)) (group->variance 'new) (observe-group 'one '(1.001 1.001 1.001)) (observe-group 'two '(1.05 1.05 1.05)) (observe-group 'three '(1.1 1.1 1.1)) (observe-group 'four '(1.003)))) (define new-var (mean results)) new-var
In the next section, we will discuss a more complicated example of ‘learning to learn’ which also uses continuous distributions at the lowest level and learns something explicitly about the mean and covariance of both basic and superordinate categories is a model which learns what object features are necessary for retrieval and recognition.
Humans are able to categorize objects (in a space with a huge number of dimensions) after seeing just one example of a new category. For example, after seeing a single wildebeest people are able to identify other wildebeest, perhaps by drawing on their knowledge of other animals. The model in Salakhutdinov et al (2010) uses abstract knowledge learned from other categories as a prior on the mean and covariance matrix of new categories.
Suppose, first that the model is given an assignment of objects to basic categories and basic categories to superordinate categories. Objects are represented as draws from a multivariate Gaussian and the mean and covariance of each basic category is determined by hyperparameters attached to the corresponding superordinate category. The parameters of the superordinate categories are all drawn from a common set of hyperparameters.
The model in the Salakhutdinov et al (2010) paper is not actually given the assignment of objects to categories and basic categories to superordinate categories, but rather learns this from the data by putting a non-parametric prior over the tree of object and category assignments.
Results are shown for this model when run on the MSR Cambridge dataset which contains images in 24 different basic level categories. Specifically, the model is given a single instance of a cow and asked to retrieve other cow images. Shown are ROC curves for classifying test images belonging to a novel category versus the rest based on observing a single instance of the novel category. The red curve shows model results using a Euclidean metric, the blue curve results from the model described above, and the black curve from an Oracle model which uses the best possible metric. Also shown is a typical partition the model discovers of basic categories into superordinate categories.
(This example comes from an unpublished manuscript by O’Donnell, Goodman, and Katzir)
One of the central problems in generative linguistics has been to account for the ease and rapidity with which children are able to acquire their language from noisy, incomplete, and sparse data. One suggestion for how this can happen is that the space of possible natural languages varies parametrically. The idea is that there are a number of higher-order constraints on structure that massively reduce the complexity of the learning problem. Each constraint is the result of a parameter taking on one of a small set of values. (This is known as “principles and parameters” theory.) The child needs only see enough data to set these parameters and the details of construction-specific structure will then generalize across the rest of the constructions of their language.
One example, is the theory of headedness and X-bar phrase structure (see Chomsky, 1970; Jackendoff, 1981). X-bar theory provides a hierarchical model for phrase structure. All phrases follow the same basic template:
\[ XP \longrightarrow Spec \ X^\prime\] \[ X^\prime \longrightarrow X \ Comp\]
Where \(X\) is a lexical (or functional) category such as \(N\) (noun), \(V\) (verb), etc. X-bar theory proposes that all phrase types have the same basic “internal geometry”; They have a head—a word of category \(X\). They also have a specifier (\(Spec\)) and a complement (\(Comp\)), the complement is more closely associated with the head than the specifier. The set of categories that can appear as complements and specifiers for a particular category of head is usually thought to be specified by universal grammar (but may also vary parametrically).
An important way in which languages vary is the order in which heads appear with respect to their complements (and specifiers). Within a language there tends to be a dominant order, often with exceptions for some category types. For instance, English is primarily a head-initial language. In verb phrases, for example, the direct object (complement noun phrase) of a verb appears to the right of the head. However, there are exceptional cases such as the order of (simple) adjective and nouns: adjectives appear before the noun rather than after it (although more complex complement types such as relative clauses appear after the noun).
The fact that languages show consistency in head directionality could be of great advantage to the learner; after encountering a relatively small number of phrase types and instances the learner of a consistent language can learn the dominant head direction in their language, transferring this knowledge to new phrase types. The fact that within many languages there are exceptions suggests that this generalization cannot be deterministic, however, and, furthermore means that a learning approach will have to be robust to within-language variability. Here is a highly simplified model of X-Bar structure:
(define data '((D N))) ;;the "grammar": a set of phrase categories, and an associating of the complement to each head category: (define categories '(D N T V A Adv)) (define (head->comp head) (case head (('D) 'N) (('T) 'V) (('N) 'A) (('V) 'Adv) (('A) 'none) (('Adv) 'none) (else 'error))) (define samples (mh-query 100 100 (define language-direction (beta 1 1)) (define head->phrase-direction (mem (lambda (head) (first (dirichlet (list language-direction (- 1 language-direction))))))) (define (generate-phrase head) (if (equal? (head->comp head) 'none) (list head) (if (flip (head->phrase-direction head)) ;;on which side will the head go? (list (head->comp head) head) ;;left, or (list head (head->comp head))))) ;;right? (define (observe-phrase) (generate-phrase (uniform-draw categories))) (generate-phrase 'N) (equal? data (repeat (length data) observe-phrase)))) (hist samples "N-phrase headedness") 'done
First, try increasing the number of copies of
(D N) observed. What happens? Now, try changing the data to
'((D N) (T V) (V Adv)). What happens if you condition on additional instance of
(V Adv) how about
What we see in this example is a simple probabilistic model capturing a version of the “principles and parameters” theory. Because it is probabilistic, systematic inferences will be drawn despite exceptional sentences or even phrase types. More importantly, due to the blessing of abstraction, the overall headedness of the language can be inferred from very little data—before the learner is very confident in the headedness of individual phrase types.
We have just seen several examples of hierarchical Bayesian models: generative models in which there are several levels of latent random choices that affect the observed data. In particular a hierarchical model is usually one in which there is a branching structure in the dependence diagram, such that the “deepest” choices affect all the data, but they only do so through a set of more shallow choices which each affect some of the data, and so on.
Many examples of hierarchical models are even simpler than the categorization examples above. The fair vs. unfair model selection example was already a simple hierarchical model; this example exhibits an abrupt (non-linear) transition from believing in a coin weight near 0.5 to one near 0.9. Such relatively abrupt transitions, and more generally complex non-linear learning curves, are characteristic of hierarchical models.
Hierarchical model structures will generally give rise to a number of important learning phenomena: transfer learning (or learning-to-learn), the blessing of abstraction, and fairly abrupt transitions.
We have spoken of the earlier choices in a hierarchical model as being more “abstract.” In computer science the
lambda operator is often called lambda abstraction. Are these two uses of “abstract” related?
There is a third notion of abstraction in a generative model which may explain the relation between these two: if we have a designated set of observations (or more generally a function that we think of as generating “perceptual” data) we can say that a random choice is abstract if it is far from the data. More specifically the degree of abstraction of an expression in a probabilistic program is the number of immediate causal dependencies (edges) from the expression to the designated observation expression (note that this is a partial, not strict, ordering on the random choices).
In a hierarchically structured model the deeper random choices are more abstract in this sense of causal distance from the data. More subtly, when a procedure is created with
lambda the expressions inside this procedure will tend to be more causally distant from the data (since the procedure must be applied before these expressions can be used), and hence greater depth of lambda abstraction will tend to lead to greater abstraction in the causal distance sense.
Chomsky1970Chomsky, N. (1970). Remarks on Nominalization. In R. A. Jacobs & P. S. Rosenbaum (Eds.), Readings in English Transformational Grammar (pp. 184–221). Waltham, Mass: Ginn.
Jackendoff1981Jackendoff, R. S. (1981). X’ Syntax: A Study of Phrase Structure. Linguistic inquiry monographs. MIT Press.
Kemp2007Kemp, C., Perfors, A., & Tenenbaum, J. B. (2007). Learning overhypotheses with hierarchical Bayesian models. Developmental Science.
Nisbett1983Nisbett, R. E., Krantz, D. H., Jepson, C., & Kunda, Z. (1983). The use of statistical heuristics in everyday inductive reasoning. Psychological Review, 90(4), 339.
Salakhutdinov2010Salakhutdinov, R., Tenenbaum, J., & Torralba, A. (2010). One-shot learning with a hierarchical nonparametric Bayesian model.
Smith2002Smith, L. B., Jones, S. S., Landau, B., Gershkoff-Stowe, L., & Samuelson, L. (2002). Object name learning provides on-the-job training for attention. Psychological Science, 13(1), 13–19.