Pith. sign in

REVIEW 1 cited by

Fast MLE Computation for the Dirichlet Multinomial

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1405.0099 v2 pith:AQ4757ME submitted 2014-05-01 stat.ML cs.LG

classification stat.MLcs.LG
keywords datadatasetdirichletalgorithmanalyzecategoricalcollectioncomputation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. High dimensional statistical inference: theoretical development to data analytics

    math.ST 2019-08 conditional novelty 1.0 of 10

    This chapter surveys asymptotic, projection-based, and discrete-model approaches for high-dimensional mean testing, covariance inference, and count data analysis.

Pith tools