The DOI matches its Crossref record; 83 of the 83 references it cites were found in a registry or an index.
A tutorial on Bayesian nonparametric models
Abstract
A key problem in statistical modeling is model selection, that is, how to choose a model at an appropriate level of complexity. This problem appears in many settings, most prominently in choosing the number of clustersinmixturemodelsorthenumberoffactorsinfactoranalysis.Inthistutorial,wedescribeBayesian nonparametric methods, a class of methods that side-steps this issue by allowing the data to determine the complexity of the model. This tutorial is a high-level introduction to Bayesian nonparametric methods and contains several examples of their application.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Kass, R. E., & Raftery, A. E. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476572 · Cited by 12,558
LIII. On lines and planes of closest fit to systems of points in space
Pearson, K. (1901) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440109462720 · Cited by 11,934
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
"General Intelligence," Objectively Determined and Measured
Spearman, C. (1904) · The American Journal of Psychology · doi:10.2307/1412107 · Cited by 6,207
A Bayesian Analysis of Some Nonparametric Problems
Ferguson, T. S. (1973) · The Annals of Statistics · doi:10.1214/aos/1176342360 · Cited by 4,697
A First Course in Factor Analysis
Comrey, A. L., & Lee, H. B. (2013) · doi:10.4324/9781315827506 · Cited by 4,546
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Cited by
Deep Unsupervised Learning using Nonequilibrium Thermodynamics
Sohl-Dickstein, J., Weiss, E. A., Maheswaranathan, N., & Ganguli, S. (2015) · arXiv · doi:10.48550/arxiv.1503.03585 · Cited by 2,637
A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
Schulz, E., Speekenbrink, M., & Krause, A. (2018) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2018.03.001 · Cited by 1,735
A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protection
Li, Q., Wen, Z., Wu, Z., Hu, S., Wang, N., Li, Y., Liu, X., & He, B. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3124599 · Cited by 1,407
Stochastic variational inference
Hoffman, M. D., Blei, D. M., Wang, C., & Paisley, J. W. (2013) · Journal of Machine Learning Research · doi:10.5555/2567709.2502622 · Cited by 1,333
Self-citationRecent Advances in Open Set Recognition: A Survey
Geng, C., Huang, S.-J., & Chen, S. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.2981604 · Cited by 1,006
Towards a neuroscience of active sampling and curiosity
Gottlieb, J., & Oudeyer, P.-Y. (2018) · Nature Reviews Neuroscience · doi:10.1038/s41583-018-0078-0 · Cited by 494
Cognitive control over learning: Creating, clustering, and generalizing task-set structure.
Collins, A. G. E., & Frank, M. J. (2013) · Psychological Review · doi:10.1037/a0030852 · Cited by 426
Barto, A., Mirolli, M., & Baldassarre, G. (2013) · Frontiers in Psychology · doi:10.3389/fpsyg.2013.00907 · Cited by 397
“Of current interest in statistics and machine learning are Bayesian non-parametric clustering methods (Gershman and Blei, 2012).”
BackgroundReinforcement learning improves behaviour from evaluative feedback
Littman, M. L. (2015) · Nature · doi:10.1038/nature14540 · Cited by 368
Time series forecasting for nonlinear and non-stationary processes: a review and comparative study
Cheng, C., Sa-Ngasoongsong, A., Beyca, O., Le, T., Yang, H., Kong, Z. (., & Bukkapatnam, S. T. S. (2015) · IIE Transactions · doi:10.1080/0740817x.2014.999180 · Cited by 287
Recio-Blanco, A., de Laverny, P., Palicio, P. A., Kordopatis, G., Álvarez, M. A., Schultheis, M., Contursi, G., Zhao, H., Torralba Elipe, G., Ordenovic, C., et al. (2023) · Astronomy & Astrophysics · doi:10.1051/0004-6361/202243750 · Cited by 256
Hippocampal remapping as hidden state inference
Sanders, H., Wilson, M. A., & Gershman, S. J. (2020) · eLife · doi:10.7554/elife.51140 · Cited by 163
Self-citationStructured Event Memory: A neuro-symbolic model of event cognition.
Franklin, N. T., Norman, K. A., Ranganath, C., Zacks, J. M., & Gershman, S. J. (2020) · Psychological Review · doi:10.1037/rev0000177 · Cited by 177
Self-citationThe computational nature of memory modification
Gershman, S. J., Monfils, M.-H., Norman, K. A., & Niv, Y. (2017) · eLife · doi:10.7554/elife.23763 · Cited by 172
Self-citationExploring a latent cause theory of classical conditioning
Gershman, S. J., & Niv, Y. (2012) · Learning & Behavior · doi:10.3758/s13420-012-0080-8 · Cited by 149
Self-citation(2014) · doi:10.1145/2635868.2635901 · Cited by 159
Discovering latent causes in reinforcement learning
Gershman, S. J., Norman, K. A., & Niv, Y. (2015) · Current Opinion in Behavioral Sciences · doi:10.1016/j.cobeha.2015.07.007 · Cited by 151
Self-citationModel averaging, optimal inference, and habit formation
FitzGerald, T. H. B., Dolan, R. J., & Friston, K. J. (2014) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2014.00457 · Cited by 121
Statistical computations underlying the dynamics of memory updating
Gershman, S. J., Radulescu, A., Norman, K. A., & Niv, Y. (2014) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003939 · Cited by 101
“The choice between modifying an existing memory versus creating a new one is formalized in our model using a nonparametric prior over partitions known as the Chinese restaurant process [33] (see [31] for an explanation of the Chinese restaurant metaphor and its origins).”
MethodSelf-citationSoto, F. A., Gershman, S. J., & Niv, Y. (2014) · Psychological Review · doi:10.1037/a0037018 · Cited by 81
Self-citationPrefrontal Goal Codes Emerge as Latent States in Probabilistic Value Learning
Stoianov, I., Genovesio, A., & Pezzulo, G. (2016) · Journal of Cognitive Neuroscience · doi:10.1162/jocn_a_00886 · Cited by 44
Cultivating creativity: predictive brains and the enlightened room problem
Constant, A., Friston, K. J., & Clark, A. (2024) · Philosophical Transactions of the Royal Society B: Biological Sciences · doi:10.1098/rstb.2022.0415 · Cited by 19
Using Dirichlet Marked Hawkes Processes for Insider Threat Detection
Zheng, P., Yuan, S., & Wu, X. (2022) · Digital Threats: Research and Practice · doi:10.1145/3457908 · Cited by 6
“The Dirichlet Process (DP) is a Bayesian nonparametric model to cluster data without specifying the number of clusters in advance [1, 2, 8, 32].”
MethodA survey on neuro-mimetic deep learning via predictive coding
Salvatori, T., Mali, A., Buckley, C. L., Lukasiewicz, T., Rao, R. P. N., Friston, K., & Ororbia, A. (2026) · Neural Networks · doi:10.1016/j.neunet.2025.108161 · Cited by 2
Metadata
- Authors
- Gershman, S. J., & Blei, D. M.
- Venue
- Journal of Mathematical Psychology
- Publisher
- Elsevier BV
- Published
- 2012-02
- Volume
- 56
- Issue
- 1
- Pages
- 1-12
- ISSN
- 0022-2496 (ISSN-L)
- OpenAlex
- W2115870554
- Cited by
- 605
- References
- 83
- FWCI
- 19.22
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.