Accelerating Maximum Likelihood Phylogenetic Inference via Early Stopping to Evade (Over-)optimization

Maximum Likelihood (ML) based phylogenetic inference constitutes a challenging optimization problem. Given a set of aligned input sequences, phylogenetic inference tools strive to determine the tree topology, the branch-lengths, and the evolutionary model parameters that maximize the phylogenetic likelihood function. However, there exist compelling reasons to not push optimization to its limits, by means of early, yet adequate stopping criteria. Since input sequences are typically subject to stochastic and systematic noise, caution is warranted to prevent (over-)optimization and the risk of overfitting the model to noisy data. To address this, we integrate the Kishino-Hasegawa (KH) test into RAxML-NG as reliable and fast-to-compute, Early Stopping criterion to effectively limit excessive and compute-intensive (over-)optimization. Initially, we introduce a simplified heuristic tree search strategy in RAxML-NG (sRAxML-NG) as a preliminary method for Early Stopping. Subsequently, we use the KH test in combination with sRAxML-NG, to statistically assess the significance of differences between intermediate trees prior to and after major optimization steps. The tree search terminates early when improvements are statistically insignificant. We also propose an extension to the standard KH test that allows to correct for multiple testing while maintaining accuracy while achieving even higher speedups. For benchmarking we use 300 large representative empirical datasets from TreeBASE. For 98% of the DNA datasets, all Early Stopping methods we introduce infer trees that are statistically equivalent to those inferred from RAxML-NG v1.2. For AA datasets, the fraction of datasets where sRAxML-NG, KH, and the KH-multiple testing version infer statistically equivalent trees is 96%, 95%, and 92%, respectively. In conjuction with sRAxML-NG, the average speedup achieved by the KH-multiple testing version is 5x for DNA and 3.9x for protein datasets compared to RAxML-NG v1.2. We implemented our stopping criteria in RAxML-NG which is available under GNU GPL at https://github.com/togkousa/raxml-ng/tree/stopping-criteria.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2025-01-15
DOI
https://doi.org/10.5281/zenodo.14653325
Primary Topic
Genomics and Phylogenetic Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Accelerating Maximum Likelihood Phylogenetic Inference via Early Stopping to Evade (Over-)optimization

Zenodo (CERN European Organization for Nuclear Research)
Genomics and Phylogenetic Studies
article

Accelerating Maximum Likelihood Phylogenetic Inference via Early Stopping to Evade (Over-)optimization

article en

Abstract

Maximum Likelihood (ML) based phylogenetic inference constitutes a challenging optimization problem. Given a set of aligned input sequences, phylogenetic inference tools strive to determine the tree topology, the branch-lengths, and the evolutionary model parameters that maximize the phylogenetic likelihood function. However, there exist compelling reasons to not push optimization to its limits, by means of early, yet adequate stopping criteria. Since input sequences are typically subject to stochastic and systematic noise, caution is warranted to prevent (over-)optimization and the risk of overfitting the model to noisy data. To address this, we integrate the Kishino-Hasegawa (KH) test into RAxML-NG as reliable and fast-to-compute, Early Stopping criterion to effectively limit excessive and compute-intensive (over-)optimization. Initially, we introduce a simplified heuristic tree search strategy in RAxML-NG (sRAxML-NG) as a preliminary method for Early Stopping. Subsequently, we use the KH test in combination with sRAxML-NG, to statistically assess the significance of differences between intermediate trees prior to and after major optimization steps. The tree search terminates early when improvements are statistically insignificant. We also propose an extension to the standard KH test that allows to correct for multiple testing while maintaining accuracy while achieving even higher speedups. For benchmarking we use 300 large representative empirical datasets from TreeBASE. For 98% of the DNA datasets, all Early Stopping methods we introduce infer trees that are statistically equivalent to those inferred from RAxML-NG v1.2. For AA datasets, the fraction of datasets where sRAxML-NG, KH, and the KH-multiple testing version infer statistically equivalent trees is 96%, 95%, and 92%, respectively. In conjuction with sRAxML-NG, the average speedup achieved by the KH-multiple testing version is 5x for DNA and 3.9x for protein datasets compared to RAxML-NG v1.2. We implemented our stopping criteria in RAxML-NG which is available under GNU GPL at https://github.com/togkousa/raxml-ng/tree/stopping-criteria.

Zenodo (CERN European Organization for Nuclear Research)
Karlsruhe Institute of Technology (DE), Heidelberg Institute for Theoretical Studies (DE)
Openalex Percentile: Top 52%
Genomics and Phylogenetic Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.