The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Beam sampling for the infinite hidden Markov model
Abstract
The infinite hidden Markov model is a non-parametric extension of the widely used hidden Markov model. Our paper introduces a new inference algorithm for the infinite Hidden Markov model called beam sampling. Beam sampling combines slice sampling, which limits the number of states considered at each time step to a finite number, with dynamic programming, which samples whole state trajectories efficiently. Our algorithm typically outperforms the Gibbs sampler and is more robust. We present applications of iHMM inference using the beam sampler on changepoint detection and text prediction problems.
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 4×
“Inference for the hidden state trajectory can be performed exactly using the forward-backward algorithm ( Rabiner, 1989 ), a dynamic programming algorithm with O(TK2) computational costs where T is the number of time steps and K number of states.”
MethodInfluentialGaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Cited by
Kalli, M., Griffin, J. E., & Walker, S. G. (2011) · Statistics and Computing · doi:10.1007/s11222-009-9150-y · Cited by 328
Hierarchical Bayesian nonparametric models with applications
Teh, Y. W., & Jordan, M. I. (2010) · Bayesian Nonparametrics · doi:10.1017/cbo9780511802478.006 · Cited by 319
Self-citationRouterdc: Query-based router by dual contrastive learning for assembling large language models
Chen, S., Jiang, W., Lin, B., Kwok, J., & Zhang, Y. (2024) · Advances in Neural Information Processing Systems 37 · doi:10.52202/079017-2120 · Cited by 22
Hong, A. E., Malinovsky, P. P., & Damodaran, S. K. (2024) · Digital Threats: Research and Practice · doi:10.1145/3604434 · Cited by 11
Metadata
- Authors
- Van Gael, J., Saatci, Y., Teh, Y. W., & Ghahramani, Z.
- Venue
- Proceedings of the 25th international conference on Machine learning - ICML '08
- Publisher
- ACM Press
- Published
- 2008
- Pages
- 1088-1095
- OpenAlex
- W2169895393
- Cited by
- 216
- References
- 3
- FWCI
- 9.68
- Type
- conference paper
- 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.