Types of approximation for probabilistic cognition: Sampling and variational

Article English OPEN
Sanborn, Adam N. (2015)

A basic challenge for probabilistic models of cognition is explaining how probabilistically correct solutions are approximated by the limited brain, and how to explain mismatches with human behavior. An emerging approach to solving this problem is to use the same approximation algorithms that were been developed in computer science and statistics for working with complex probabilistic models. Two types of approximation algorithms have been used for this purpose: sampling algorithms, such as importance sampling and Markov chain Monte Carlo, and variational algorithms, such as mean-field approximations and assumed density filtering. Here I briefly review this work, outlining how the algorithms work, how they can explain behavioral biases, and how they might be implemented in the brain. There are characteristic differences between how these two types of approximation are applied in brain and behavior, which points to how they could be combined in future research.
  • References (40)
    40 references, page 1 of 4

    Abbott, J. T., & Griffiths, T. L. (2011). Exploring the influence of particle filter parameters on order effects in causal learning. In Proceedings of the 33rd annual conference of the cognitive science society.

    Anderson, J. R. (1991). The adaptive nature of human categorization. Psychological Review, 98(3), 409-429.

    Beck, J., Pouget, A., & Heller, K. A. (2012). Complex inference in neural circuits with probabilistic population codes and topic models. In F. Pereira, C. Burges, L. Bottou, & K. Weinberger (Eds.). Advances in neural information processing systems (Vol. 25, pp. 3059-3067). Curran Associates, Inc.

    Bishop, C. M. (2006). Pattern recognition and machine learning. New York, NY: Springer.

    Brown, S. D., & Steyvers, M. (2009). Detecting and predicting changes. Cognitive Psychology, 58, 49-67.

    Buesing, L., Bill, J., Nessler, B., & Maass, W. (2011). Neural dynamics as sampling: A model for stochastic computation in recurrent networks of spiking neurons. PLoS Computational Biology, 7(11), e1002211.

    Daw, N. D., & Courville, A. C. (2008). The pigeon as particle filter. In J. Platt, D. Koller, Y. Singer, & S. Roweis (Eds.). Advances in neural information processing systems (Vol. 20, pp. 369-376). Cambridge, MA: MIT Press.

    Daw, N. D., Courville, A. C., & Dayan, P. (2008). Semi-rational models of conditioning: The case of trial order. In N. Chater & M. Oaksford (Eds.), The probabilistic mind (pp. 431-452). Oxford, UK: Oxford University Press.

    Doucet, A., de Freitas, N., & Gordon, N. (2001). Sequential Monte Carlo methods in practice. New York: Springer.

    Fiser, J., Berkes, P., Orbán, G., & Lengyel, M. (2010). Statistically optimal perception and learning: From behavior to neural representations. Trends in Cognitive Sciences, 14, 119-130.

  • Metrics
    No metrics available
Share - Bookmark