Fast MLE Computation for the Dirichlet Multinomial
Not on the map. Why?
Abstract (arXiv)
Given a collection of categorical data, we want to find the parameters of a Dirichlet distribution which maximizes the likelihood of that data. Newton's method is typically used for this purpose but current implementations require reading through the entire dataset on each iteration. In this paper, we propose a modification which requires only a single pass through the dataset and substantially decreases running time. Furthermore we analyze both theoretically and empirically the performance of the proposed algorithm, and provide an open source implementation.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 1 May 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
3 papers.
- 2022Sampling Bias Correction for Supervised Machine Learning: A Bayesian Inference Approach with Practical Applicationscited by 1
- 2025Pushing Toward the Simplex Vertices: A Simple Remedy for Code Collapse in Smoothed Vector Quantizationcited by 0
- 2026Deviance-style normalization for jointly overdispersed countscited by 0
- 2026Deviance-style normalization for jointly overdispersed counts24 Jun 2026
- 2025Pushing Toward the Simplex Vertices: A Simple Remedy for Code Collapse in Smoothed Vector Quantization26 Sep 2025
- 2022Sampling Bias Correction for Supervised Machine Learning: A Bayesian Inference Approach with Practical Applications11 Mar 2022