1 Introduction
Truly intelligent systems can learn and make decisions without human intervention. Therefore it is not surprising that early machine learning efforts, such as the perceptron, have been neurally inspired
[1]. In recent years, probabilistic modelling has become a cornerstone of machine learning approaches [2, 3, 4], with applications in neural processing [5, 6, 3, 7] and human learning [8, 9].From a probabilistic perspective, the ability for a model to automatically discover patterns and perform extrapolation is determined by its support (which solutions are a priori possible), and inductive biases (which solutions are a priori likely). Ideally, we want a model to be able to represent many possible solutions to a given problem, with inductive biases which can extract intricate structure from limited data. For example, if we are performing character recognition, we would want our support to contain a large collection of potential characters, accounting even for rare writing styles, and our inductive biases to reasonably reflect the probability of encountering each character
[10, 11].The support and inductive biases of a wide range of probabilistic models, and thus the ability for these models to learn and generalise, is implicitly controlled by a covariance kernel
, which determines the similarities between pairs of datapoints. For example, Bayesian basis function regression (including, e.g., all polynomial models), splines, and infinite neural networks, can all exactly be represented as a Gaussian process with a particular kernel function
[12, 11, 10]. Moreover, the Fisher kernel provides a mechanism to reformulate probabilistic generative models as kernel methods [13].In this paper, we wish to reverse engineer humanlike support and inductive biases for function learning, using a Gaussian process based kernel learning formalism. In particular:

We create new human function learning datasets, including novel function extrapolation problems and multiplechoice questions that explore human intuitions about simplicity and explanatory power. To participate in these experiments, and view demonstrations, see
http://functionlearning.com/ 
We develop a statistical framework for kernel learning from the predictions of a model, conditioned on the (training) information that model is given. The ability to sample multiple
sets of posterior predictions from a model, at any input locations of our choice, given any dataset of our choice, provides unprecedented statistical strength for kernel learning. By contrast, standard kernel learning involves fitting a kernel to a fixed dataset that can only be viewed as a
single realisation from a stochastic process. Our framework leverages spectral mixture kernels [14]and nonparametric estimates.

We exploit this framework to directly learn kernels from human responses, which contrasts with all prior work on human function learning, where one compares a fixed model to human responses. Moreover, we consider individual rather than averaged human extrapolations.

We interpret the learned kernels to gain scientific insights into human inductive biases, including the ability to adapt to new information for function learning. We also use the learned “human kernels” to inspire new types of covariance functions which can enable extrapolation on problems which are difficult for conventional Gaussian process models.

We study Occam’s razor in human function learning, and compare to Gaussian process marginal likelihood based model selection, which we show is biased towards underfitting.

We provide an expressive quantitative means to compare existing machine learning algorithms with human learning, and a mechanism to directly infer human prior representations.
Our work is intended as a preliminary step towards building probabilistic kernel machines that encapsulate humanlike support and inductive biases. Since state of the art machine learning methods perform conspicuously poorly on a number of extrapolation problems which would be easy for humans [10], such efforts have the potential to help automate machine learning and improve performance on a wide range of tasks – including settings which are difficult for humans to process (e.g., big data and high dimensional problems). Finally, the presented framework can be considered in a more general context, where one wishes to efficiently reverse engineer interpretable properties of any model (e.g., a deep neural network) from its predictions.
2 Related Work
Historically, efforts to understand human function learning have focused on rulebased relationships (e.g., polynomial or powerlaw functions) [15, 16]
, or interpolation based on similarity learning
[17, 18]. Griffiths et al. [19] were the first to note that a Gaussian process framework can be used to unify these two perspectives. They introduced a GP model with a mixture of RBF and polynomial kernels to reflect the human ability to learn arbitrary smooth functions while still identifying simple parametric functions. They applied this model to a standard set of evaluation tasks, comparing predictions on simple functions to averaged human judgments, and interpolation performance to human error rates. Lucas et al. [20] extended this model to accommodate a wider range of phenomena, using an infinite mixture of Gaussian process experts [21], and Lucas et al. [22] used this model to shed new light on human predictions given sparse data.Our work complements these pioneering Gaussian process models and prior work on human function learning, but has many features that distinguish it from previous contributions: (1) rather than iteratively building models and comparing them to human predictions, based on fixed assumptions about the regularities humans can recognize, we are directly learning the properties of the human model through advanced kernel learning techniques; (2) essentially all models of function learning, including past GP models, are evaluated on averaged human responses, setting aside individual differences and erasing critical statistical structure in the data^{1}^{1}1For example, averaging prior draws from a Gaussian process would remove the structure necessary for kernel learning, leaving us simply with an approximation of the prior mean function.. By contrast, our approach uses individual responses; (3) many recent model evaluations rely on relatively small and heterogeneous sets of experimental data. The evaluation corpora using recent reviews [23, 19] are limited to a small set of parametric forms, i.e., polynomial, powerlaw, logistic, logarithmic, exponential, and sinusoidal, and the more detailed analyses tend to involve only linear, quadratic, and logistic functions. Other projects have collected richer and more detailed data sets [24, 25], but we are only aware of coarsegrained, qualitative analyses using these data. Moreover, experiments that depart from simple parametric functions tend to use very noisy data. Thus it is unsurprising that participants tend to revert to the prior mode that arises in almost all function learning experiments: linear functions, especially with slope1 and intercept0 [24, 25] (but see [26]). In a departure from prior work, we create original function learning problems with no simple parametric description and no noise – where it is obvious that human learners cannot resort to simple rules – and acquire the human data ourselves. We hope these novel datasets will inspire more detailed findings on function learning; (4) we learn kernels from human responses, which (i) provide insights into the biases that drive human function learning and the human ability to progressively adapt to new information, and (ii) enable humanlike extrapolations on problems that are difficult for conventional Gaussian process models; and (5) we investigate Occam’s razor in human function learning and nonparametric model selection.
3 The Human Kernel
The rulebased and associative theories for human function learning can be unified as part of a Gaussian process framework. Indeed, Gaussian processes contain a large array of probabilistic models, and have the nonparametric flexibility to produce infinitely many consistent (zero training error) fits to any dataset. Moreover, the support and inductive biases of a Gaussian process are encaspulated by a covariance kernel. Our goal is to learn Gaussian process covariance kernels from predictions made by humans on function learning experiments, to gain a better understanding of human learning, and to inspire new machine learning models, with improved extrapolation performance, and minimal human intervention.
3.1 Problem Setup
A (human) learner is given access to data at training inputs , and makes predictions at testing inputs . We assume the predictions are samples from the learner’s posterior distribution over possible functions, following results showing that human inferences and judgments resemble posterior samples across a wide range of perceptual and decisionmaking tasks [27, 28, 29]. We assume we can obtain multiple draws of for a given and .
3.2 Kernel Learning
In standard Gaussian process applications, one has access to a single realisation of data
, and performs kernel learning by optimizing the marginal likelihood of the data with respect to covariance function hyperparameters
, as described in the supplementary material. However, with only a single realisation of data we are highly constrained in our ability to learn an expressive kernel function – requiring us to make strong assumptions, such as RBF covariances, to extract any useful information from the data. One can see this by simulating datapoints from a GP with a known kernel, and then visualising the empirical estimate of the known covariance matrix . The empirical estimate, in most cases, will look nothing like . However, perhaps surprisingly, if we have even a small number of multiple draws from a GP, we can recover a wide array of covariance matrices using the empirical estimator , where is an data matrix, for draws, andis a vector of empirical means.
The typical goal in choosing (learning) a kernel is to minimize some loss function evaluated on training data, ultimately to minimize generalisation error. But here we want to reverse engineer the (prediction) kernel of a (human) model, based on both training data and predictions of that model given that training data. If we have a single sample extrapolation,
, at test inputs , based on training points , and Gaussian noise, the probability is given by the posterior predictive distribution of a Gaussian process, with . One can use this probability as a utility function for kernel learning, much like the marginal likelihood. See the supplementary material for details of these distributions.Our problem setup affords unprecedented opportunities for flexible kernel learning. If we have multiple sample extrapolations from a given set of training data, , then the predictive conditional marginal likelihood becomes . One could apply this new objective, for instance, if we were to view different human extrapolations as multiple draws from a common generative model. Clearly this assumption is not entirely correct, since different people will have different biases, but it naturally suits our purposes: we are not as interested in the differences between people as their shared inductive biases, and assuming multiple draws from a common generative model provides extraordinary statistical strength for learning these shared biases. Ultimately, we will consider modelling the human responses both separately and collectively, studying the differences and similarities between the responses.
One option for learning a prediction kernel is to specify a flexible parametric form for and then learn by optimizing our chosen objective functions. For this approach, we choose the recent spectral mixture kernels of Wilson and Adams [14], which can model a wide range of stationary covariances, and are intended to help automate kernel selection. However, we note that our objective function can readily be applied to other parametric forms. We also consider empirical nonparametric kernel estimation, since nonparametric kernel estimators can have the flexibility to converge to any positive definite kernel, and thus become appealing when we have the signal strength provided by multiple draws from a stochastic process.
4 Human Experiments
We wish to discover kernels that capture human inductive biases for learning functions and extrapolating from complex or ambiguous training data. We start by testing the consistency of our kernel learning procedure in section 4.1. In section 4.2, we study progressive function learning. Indeed, humans participants will have a different representation (e.g., learned kernel) for different observed data, and examining how these representations progressively adapt with new information can shed light on our prior biases. In section 4.3, we learn human kernels to extrapolate on tasks which are difficult for Gaussian processes with standard kernels. In section 4.4, we study model selection in human function learning. All human participants were recruited using Amazon’s mechanical turk and saw experimental materials that are described in the supplement, with demonstrations provided at http://functionlearning.com/. When we are considering stationary ground truth kernels, we use a spectral mixture for kernel learning; otherwise, we use a nonparametric empirical estimate.
4.1 Reconstructing Ground Truth Kernels
We use simulations with a known ground truth to test the consistency of our kernel learning procedure, and the effects of multiple posterior draws, in converging to a kernel which has been used to make predictions.
We sample datapoints from a GP with RBF kernel (the supplement describes GPs), , at random input locations. Conditioned on these data, we then sample multiple posterior draws, , each containing datapoints, from a GP with a spectral mixture kernel [14] with two components (the prediction kernel). The prediction kernel has deliberately not been trained to fit the data kernel. To reconstruct the prediction kernel, we learn the parameters of a randomly initialized spectral mixture kernel with five components, by optimizing the predictive conditional marginal likelihood wrt .
Figure 1 compares the learned kernels for different numbers of posterior draws against the data kernel (RBF) and the prediction kernel (spectral mixture). For a single posterior draw, the learned kernel captures the highfrequency component of the prediction kernel but fails at reconstructing the lowfrequency component. Only with multiple draws does the learned kernel capture the longerrange dependencies. The fact that the learned kernel converges to the prediction kernel, which is different from the data kernel, shows the consistency of our procedure, which could be used to infer aspects of human inductive biases.
4.2 Progressive Function Learning
We asked humans to extrapolate beyond training data in two sets of 5 functions, each drawn from GPs with known kernels. The learners extrapolated on these problems in sequence, and thus had an opportunity to progressively learn more about the underlying kernel in each set. To further test progressive function learning, we repeated the first function at the end of the experiment, for six functions in each set. We asked for extrapolation judgments because they provide more information about inductive biases than interpolation, and pose difficulties for conventional Gaussian process kernels [14, 10, 30].
The observed functions are shown in black in Figure 2, the human responses in blue, and the true extrapolation in dashed black. In the first two rows, the black functions are drawn from a GP with a rational quadratic (RQ) kernel [12] (for heavy tailed correlations), and there are 20 human participants.
We show the learned human kernel, the data generating kernel, the human kernel learned from a spectral mixture, and an RBF kernel trained only on the data, in Figures 2 and 2, respectively corresponding to Figures 2 and 2
. Initially, both the human learners and RQ kernel show heavy tailed behaviour, and a bias for decreasing correlations with distance in the input space, but the human learners have a high degree of variance. By the time they have seen Figure
2, they are more confident in their predictions, and more accurately able to estimate the true signal variance of the function. Visually, the extrapolations look more confident and reasonable. Indeed, the human learners adapt their representations (e.g., learned kernels) to more data. However, we can see in Figure 2 that the human learners are still overestimating the tails of the kernel, perhaps suggesting a strong prior bias for heavytailed correlations.The learned RBF kernel, by contrast, cannot capture the heavy tailed nature of the training data (long range correlations), due to its Gaussian parametrization. Moreover, the learned RBF kernel underestimates the signal variance of the data, because it overestimates the noise variance (not shown), to explain away the heavy tailed properties of the data (its model misspecification).
In the second two rows, we consider a problem with highly complex structure, and only participants. Here, the functions are drawn from a product of spectral mixture and linear kernels. As the participants see more functions, they appear to expect linear trends, and become more similar in their predictions. In Figures 2 and 2, we show the learned and true predictive correlation matrices using empirical estimators which indicate similar correlation structure.
4.3 Discovering Unconventional Kernels
The experiments reported in this section follow the same general procedure described in section 4.2. In this case, human participants were asked to extrapolate from two single training sets, in counterbalanced order: a sawtooth function (Figure 3), and a step function (Figure 3), with training data shown as dashed black lines.
These types of functions are notoriously difficult for standard Gaussian process kernels [12], due to sharp discontinuities and nonstationary behaviour. In Figures 3, 3, 3, we used agglomerative clustering to process the human responses into three categories, shown in purple, green, and blue. The empirical covariance matrix of the first cluster (Figure 3) shows the dependencies of the sawtooth form that characterize this cluster. In Figures 3, 3, 3, we sample from the learned human kernels, following the same colour scheme. The samples appear to replicate the human behaviour, and the purple samples provide reasonable extrapolations. By contrast, posterior samples from a GP with a spectral mixture kernel trained on the black data in this case quickly revert to a prior mean, as shown in Fig 3. The data are sufficiently sparse, nondifferentiable, and nonstationary, that the spectral mixture kernel is less inclined to produce a long range extrapolation than human learners, who attempt to generalise from a very small amount of information.
For the step function, we clustered the human extrapolations based on response time and total variation of the predicted function. Responses that took between 50 and 200 seconds and did not vary by more than units, shown in Figure 3, appeared reasonable. The other responses are shown in Figure 3. The empirical covariance matrices of both sets of predictions in Figures 3 and 3 show the characteristics of the responses. While the first matrix exhibits a block structure indicating stepfunctions, the second matrix shows fast changes between positive and negative dependencies characteristic of the high frequency responses. Posterior sample extrapolations using the empirical human kernels are shown in Figures 3 and 3. In Figures 3 and 3 we show posterior samples from GPs with spectral mixture and RBF kernels, trained on the black data (e.g., given the same information as the human learners). The spectral mixture kernel is able to extract some structure (some horizontal and vertical movement), but is overconfident, and unconvincing compared to the human kernel extrapolations. The RBF kernel is unable to learn much structure in the data.
4.4 Human Occam’s Razor
If you were asked to predict the next number in the sequence , you are likely more inclined to guess than . However, we can produce either answer using different hypotheses that are entirely consistent with the data. Occam’s razor describes our natural tendency to favour the simplest hypothesis that fits the data, and is of foundational importance in statistical model selection. For example, MacKay [31]
argues that Occam’s razor is automatically embodied by the marginal likelihood in performing Bayesian inference: indeed, in our number sequence example, marginal likelihood computations show that
is millions of times more probable than, even if the prior odds are equal.
Occam’s razor is vitally important in nonparametric models such as Gaussian processes, which have the flexibility to represent infinitely many consistent solutions to any given problem, but avoid overfitting through Bayesian inference. For example, the marginal likelihood of a Gaussian process (supplement) separates into automatically calibrated model fit and model complexity terms, sometimes referred to as automatic Occam’s razor [32].
The marginal likelihood is the probability that if we were to randomly sample parameters from that we would create dataset [e.g., 32, 10]. Simple models can only generate a small number of datasets, but because the marginal likelihood must normalise, it will generate these datasets with high probability. Complex models can generate a wide range of datasets, but each with typically low probability. For a given dataset, the marginal likelihood will favour a model of more appropriate complexity. This argument is illustrated in Fig 4. Fig 4 illustrates this principle with GPs.
Here we examine Occam’s razor in human learning, and compare the Gaussian process marginal likelihood ranking of functions, all consistent with the data, to human preferences. We generated a dataset sampled from a GP with an RBF kernel, and presented users with a subsample of 5 points, as well as seven possible GP function fits, internally labelled as follows: (1) the predictive mean of a GP after maximum marginal likelihood hyperparameter estimation; (2) the generating function; (37) the predictive means of GPs with larger to smaller lengthscales (simpler to more complex fits). We repeated this procedure four times, to create four datasets in total, and acquired human rankings on each, for total rankings. Each participant was shown the same unlabelled functions but with different random orderings. The datasets, along with participant instructions, are in the supplement, and available at http://functionlearning.com/.
Human Occam’s Razor. (a) Number of first place (highest ranking) votes for each function. (b) Average human ranking (with standard deviations) of functions compared to first place ranking defined by (a). (c) Average human ranking vs. average GP marginal likelihood ranking of functions. ‘ML’ = marginal likelihood optimum, ‘Truth’ = true extrapolation. Blue numbers are offsets to the log lengthscale from the marginal likelihood optimum. Positive offsets correspond to simpler solutions.
Figure 5 shows the number of times each function was voted as the best fit to the data. The proportion of first place votes for each function follows the internal (latent) ordering defined above. The maximum marginal likelihood solution receives the most (%) first place votes. Functions and received similar numbers (between 15% and 18%) of first place votes; these choices were all strongly favoured, and in total have more votes than the maximum marginal likelihood solution. The solutions which have a smaller lengthscale (greater complexity) than the marginal likelihood best fit – represented by functions and – received a relatively small number of first place votes. These findings suggest that on average humans prefer overly simple to overly complex explanations of the data. Moreover, participants generally agree with the GP marginal likelihood’s first choice preference, even over the true generating function. However, these data also suggest that participants have a wide array of prior biases, leading to different people often choosing very different looking functions as their first choice fit. Furthermore, % () of participants responded that their first ranked choice was “likely to have generated the data” and looks “very similar” to what they would have imagined.
It’s possible for highly probable solutions to be underrepresented in Figure 5: we might imagine, for example, that a particular solution is never ranked first, but always second. In Figure 5
, we show the average rankings, with standard deviations (the standard errors are
), compared to the first choice rankings, for each function. There is a general correspondence between rankings, suggesting that although human distributions over functions have different modes, these distributions have a similar allocation of probability mass. The standard deviations suggest that there is relatively more agreement that the complex small lengthscale functions (labels 5, 6, 7) are improbable, than about specific preferences for functions 1, 2, 3, and 4.Finally, in Figure 5, we compare the average human rankings with the average GP marginal likelihood rankings. There are clear trends: (1) humans agree with the GP marginal likelihood about the best fit, and that empirically decreasing the lengthscale below the best fit value monotonically decreases a solution’s probability; (2) humans penalize simple solutions less than the marginal likelihood, with function receiving a last (7th) place ranking from the marginal likelihood.
Despite the observed human tendency to favour simplicity more than the GP marginal likelihood, Gaussian process marginal likelihood optimisation is surprisingly biased towards underfitting in function space. If we generate data from a GP with a known lengthscale, the mode of the marginal likelihood, on average, will overestimate the true lengthscale (Figures 1 and 2 in the supplement). If we are unconstrained in estimating the GP covariance matrix, we will converge to the maximum likelihood estimator, , which is degenerate and therefore biased. Parametrizing a covariance matrix by a lengthscale (for example, by using an RBF kernel), restricts this matrix to a lowdimensional manifold on the full space of covariance matrices. A biased estimator will remain biased when constrained to a lower dimensional manifold, as long as the manifold allows movement in the direction of the bias. Increasing a lengthscale moves a covariance matrix towards the degeneracy of the unconstrained maximum likelihood estimator. With more data, the lowdimensional manifold becomes more constrained, and less influenced by this underfitting bias.
5 Discussion
We have shown that (1) human learners have systematic expectations about smooth functions that deviate from the inductive biases inherent in the RBF kernels that have been used in past models of function learning; (2) it is possible to extract kernels that reproduce qualitative features of human inductive biases, including the variable sawtooth and step patterns; (3) that human learners favour smoother or simpler functions, even in comparison to GP models that tend to overpenalize complexity; and (4) that is it possible to build models that extrapolate in humanlike ways which go beyond traditional stationary and polynomial kernels.
We have focused on human extrapolation from noisefree nonparametric relationships. This approach complements past work emphasizing simple parametric functions and the role of noise [e.g., 25], but kernel learning might also be applied in these other settings. In particular, iterated learning (IL) experiments [24] provide a way to draw samples that reflect human learners’ a priori expectations. Like most function learning experiments, past IL experiments have presented learners with sequential data. Our approach, following Little and Shiffrin [25], instead presents learners with plots of functions. This method is useful in reducing the effects of memory limitations and other sources of noise (e.g., in perception). It is possible that people show different inductive biases across these two presentation modes. Future work, using multiple presentation formats with the same underlying relationships, will help resolve these questions.
Finally, the ideas discussed in this paper could be applied more generally, to discover interpretable properties of unknown models from their predictions. Here one encounters fascinating questions at the intersection of active learning, experimental design, and information theory.
Acknowledgments
We thank Tom Minka for helpful discussions.
References
 McCulloch and Pitts [1943] W.S. McCulloch and W. Pitts. A logical calculus of the ideas immanent in nervous activity. Bulletin of mathematical biology, 5(4):115–133, 1943.
 Bishop [2006] Christopher M. Bishop. Pattern Recognition and Machine Learning. Springer, 2006.
 Doya et al. [2007] K. Doya, S. Ishii, A. Pouget, and R.P.N. Rao. Bayesian brain: probabilistic approaches to neural coding. MIT Press, 2007.

Ghahramani [2015]
Zoubin Ghahramani.
Probabilistic machine learning and artificial intelligence.
Nature, 521(7553):452–459, 2015.  Wolpert et al. [1995] Daniel M Wolpert, Zoubin Ghahramani, and Michael I Jordan. An internal model for sensorimotor integration. Science, 269(5232):1880–1882, 1995.
 Knill and Richards [1996] David C Knill and Whitman Richards. Perception as Bayesian inference. Cambridge University Press, 1996.

Deneve [2008]
Sophie Deneve.
Bayesian spiking neurons i: inference.
Neural computation, 20(1):91–117, 2008.  Griffiths and Tenenbaum [2006] Thomas L Griffiths and Joshua B Tenenbaum. Optimal predictions in everyday cognition. Psychological Science, 17(9):767–773, 2006.
 Tenenbaum et al. [2011] J.B. Tenenbaum, C. Kemp, T.L. Griffiths, and N.D. Goodman. How to grow a mind: Statistics, structure, and abstraction. Science, 331(6022):1279–1285, 2011.

Wilson [2014]
Andrew Gordon Wilson.
Covariance kernels for fast automatic pattern discovery and
extrapolation with Gaussian processes.
PhD thesis, University of Cambridge, 2014.
http://www.cs.cmu.edu/~andrewgw/andrewgwthesis.pdf.  Neal [1996] R.M. Neal. Bayesian Learning for Neural Networks. Springer Verlag, 1996. ISBN 0387947248.
 Rasmussen and Williams [2006] C. E. Rasmussen and C. K. I. Williams. Gaussian processes for Machine Learning. MIT Press, 2006.

Jaakkola et al. [1998]
Tommi Jaakkola, David Haussler, et al.
Exploiting generative models in discriminative classifiers.
Advances in neural information processing systems, pages 487–493, 1998.  Wilson and Adams [2013] Andrew Gordon Wilson and Ryan Prescott Adams. Gaussian process kernels for pattern discovery and extrapolation. International Conference on Machine Learning (ICML), 2013.
 Carroll [1963] J Douglas Carroll. Functional learning: The learning of continuous functional mappings relating stimulus and response continua. ETS Research Bulletin Series, 1963(2), 1963.
 Koh and Meyer [1991] Kyunghee Koh and David E Meyer. Function learning: Induction of continuous stimulusresponse relations. Journal of Experimental Psychology: Learning, Memory, and Cognition, 17(5):811, 1991.
 DeLosh et al. [1997] Edward L DeLosh, Jerome R Busemeyer, and Mark A McDaniel. Extrapolation: The sine qua non for abstraction in function learning. Journal of Experimental Psychology: Learning, Memory, and Cognition, 23(4):968, 1997.
 Busemeyer et al. [1997] Jerome R Busemeyer, Eunhee Byun, Edward L Delosh, and Mark A McDaniel. Learning functional relations based on experience with inputoutput pairs by humans and artificial neural networks. Concepts and Categories, 1997.
 Griffiths et al. [2009] Thomas L Griffiths, Chris Lucas, Joseph Williams, and Michael L Kalish. Modeling human function learning with gaussian processes. In Advances in Neural Information Processing Systems, pages 553–560, 2009.
 Lucas et al. [2015] Christopher G Lucas, Thomas L Griffiths, Joseph J Williams, and Michael L Kalish. A rational model of function learning. Psychonomic bulletin & review, pages 1–23, 2015.
 Rasmussen and Ghahramani [2002] C.E. Rasmussen and Z. Ghahramani. Infinite mixtures of Gaussian process experts. In Advances in neural information processing systems 14: proceedings of the 2002 conference, volume 2, page 881. MIT Press, 2002.
 Lucas et al. [2012] Christopher G Lucas, Douglas Sterling, and Charles Kemp. Superspace extrapolation reveals inductive biases in function learning. In Cognitive Science Society, 2012.
 Mcdaniel and Busemeyer [2005] Mark A Mcdaniel and Jerome R Busemeyer. The conceptual basis of function learning and extrapolation: Comparison of rulebased and associativebased models. Psychonomic bulletin & review, 12(1):24–42, 2005.
 Kalish et al. [2007] Michael L Kalish, Thomas L Griffiths, and Stephan Lewandowsky. Iterated learning: Intergenerational knowledge transmission reveals inductive biases. Psychonomic Bulletin & Review, 14(2):288–294, 2007.
 Little and Shiffrin [2009] Daniel R Little and Richard M Shiffrin. Simplicity bias in the estimation of causal functions. In Proceedings of the 31st Annual Conference of the Cognitive Science Society, pages 1157–1162, 2009.
 Johnson et al. [2014] Samuel GB Johnson, Andy Jin, and Frank C Keil. Simplicity and goodnessoffit in explanation: The case of intuitive curvefitting. In Proceedings of the 36th Annual Conference of the Cognitive Science Society, pages 701–706, 2014.
 Gershman et al. [2012] Samuel J Gershman, Edward Vul, and Joshua B Tenenbaum. Multistability and perceptual inference. Neural computation, 24(1):1–24, 2012.
 Griffiths et al. [2012] Thomas L Griffiths, Edward Vul, and Adam N Sanborn. Bridging levels of analysis for probabilistic models of cognition. Current Directions in Psychological Science, 21(4):263–268, 2012.
 Vul et al. [2014] Edward Vul, Noah Goodman, Thomas L Griffiths, and Joshua B Tenenbaum. One and done? optimal decisions from very few samples. Cognitive science, 38(4):599–637, 2014.
 Wilson et al. [2014] Andrew Gordon Wilson, Elad Gilboa, Arye Nehorai, and John P. Cunningham. Fast kernel learning for multidimensional pattern extrapolation. In Advances in Neural Information Processing Systems, 2014.
 MacKay [2003] David JC MacKay. Information theory, inference, and learning algorithms. Cambridge University Press, 2003.
 Rasmussen and Ghahramani [2001] Carl Edward Rasmussen and Zoubin Ghahramani. Occam’s razor. In Neural Information Processing Systems (NIPS), 2001.
 Williams [1998] Christopher KI Williams. Computation with infinite neural networks. Neural Computation, 10(5):1203–1216, 1998.
 Wilson [2012] Andrew Gordon Wilson. A process over all stationary kernels. Technical report, University of Cambridge, 2012.
Supplementary Material
In the supplementary material, available at http://www.cs.cmu.edu/~andrewgw/humansupp.pdf, we provide a brief review of Gaussian processes, and additional experiments regarding the underfitting property of GP maximum marginal likelihood estimation of kernel lengthscales. We also provide the instructions and some of the questions asked in the human experiments. To participate in the exact experiments, see http://www.functionlearning.com.