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. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.CO 1years
2025 1verdicts
CONDITIONAL 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.