The Free Lunch is not over yet-systematic exploration of numerical thresholds in maximum likelihood phylogenetic inference
- PMID: 37750068
- PMCID: PMC10518076
- DOI: 10.1093/bioadv/vbad124
The Free Lunch is not over yet-systematic exploration of numerical thresholds in maximum likelihood phylogenetic inference
Abstract
Summary: Maximum likelihood (ML) is a widely used phylogenetic inference method. ML implementations heavily rely on numerical optimization routines that use internal numerical thresholds to determine convergence. We systematically analyze the impact of these threshold settings on the log-likelihood and runtimes for ML tree inferences with RAxML-NG, IQ-TREE, and FastTree on empirical datasets. We provide empirical evidence that we can substantially accelerate tree inferences with RAxML-NG and IQ-TREE by changing the default values of two such numerical thresholds. At the same time, altering these settings does not significantly impact the quality of the inferred trees. We further show that increasing both thresholds accelerates the RAxML-NG bootstrap without influencing the resulting support values. For RAxML-NG, increasing the likelihood thresholds and to 10 and 103, respectively, results in an average tree inference speedup of 1.9 ± 0.6 on Data collection 1, 1.8 ± 1.1 on Data collection 2, and 1.9 ± 0.8 on Data collection 2 for the RAxML-NG bootstrap compared to the runtime under the current default setting. Increasing the likelihood threshold to 10 in IQ-TREE results in an average tree inference speedup of 1.3 ± 0.4 on Data collection 1 and 1.3 ± 0.9 on Data collection 2.
Availability and implementation: All MSAs we used for our analyses, as well as all results, are available for download at https://cme.h-its.org/exelixis/material/freeLunch_data.tar.gz. Our data generation scripts are available at https://github.com/tschuelia/ml-numerical-analysis.
© The Author(s) 2023. Published by Oxford University Press.
Conflict of interest statement
None declared.
Figures





References
-
- Brent RP. An algorithm with guaranteed convergence for finding a zero of a function. Comput J 1971;14:422–5. 10.1093/comjnl/14.4.422 - DOI
-
- Corey DM, Dunlap WP, Burke MJ.. Averaging correlations: expected values and bias in combined Pearson rs and Fisher’s z transformations. J Gen Psychol 1998;125:245–61. 10.1080/00221309809595548 - DOI
-
- Farris JS. Methods for computing wagner trees. Syst Biol 1970;19:83–92. 10.1093/sysbio/19.1.83 - DOI
LinkOut - more resources
Full Text Sources