With polynomially many samples on balanced trees and small edge mutation probabilities, the empirical log-likelihood for branch-length estimation is strongly concave on a universal box, and coordinate maximization converges exponentially fast to a statistically consistent MLE.
Title resolution pending
1 Pith paper cite this work, alongside 244 external citations. Polarity classification is still indexing.
1
Pith paper citing it
244
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
stat.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Sample Complexity of Branch-length Estimation by Maximum Likelihood
With polynomially many samples on balanced trees and small edge mutation probabilities, the empirical log-likelihood for branch-length estimation is strongly concave on a universal box, and coordinate maximization converges exponentially fast to a statistically consistent MLE.