Torchtree: flexible phylogenetic model development and inference using PyTorch

Mathieu Fourment, Matthew Macaulay, Christiaan J Swanepoel, Xiang Ji, Marc A Suchard, Frederick A Matsen IV
{"title":"Torchtree: flexible phylogenetic model development and inference using PyTorch","authors":"Mathieu Fourment, Matthew Macaulay, Christiaan J Swanepoel, Xiang Ji, Marc A Suchard, Frederick A Matsen IV","doi":"arxiv-2406.18044","DOIUrl":null,"url":null,"abstract":"Bayesian inference has predominantly relied on the Markov chain Monte Carlo\n(MCMC) algorithm for many years. However, MCMC is computationally laborious,\nespecially for complex phylogenetic models of time trees. This bottleneck has\nled to the search for alternatives, such as variational Bayes, which can scale\nbetter to large datasets. In this paper, we introduce torchtree, a framework\nwritten in Python that allows developers to easily implement rich phylogenetic\nmodels and algorithms using a fixed tree topology. One can either use automatic\ndifferentiation, or leverage torchtree's plug-in system to compute gradients\nanalytically for model components for which automatic differentiation is slow.\nWe demonstrate that the torchtree variational inference framework performs\nsimilarly to BEAST in terms of speed and approximation accuracy. Furthermore,\nwe explore the use of the forward KL divergence as an optimizing criterion for\nvariational inference, which can handle discontinuous and non-differentiable\nmodels. Our experiments show that inference using the forward KL divergence\ntends to be faster per iteration compared to the evidence lower bound (ELBO)\ncriterion, although the ELBO-based inference may converge faster in some cases.\nOverall, torchtree provides a flexible and efficient framework for phylogenetic\nmodel development and inference using PyTorch.","PeriodicalId":501215,"journal":{"name":"arXiv - STAT - Computation","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.18044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Bayesian inference has predominantly relied on the Markov chain Monte Carlo (MCMC) algorithm for many years. However, MCMC is computationally laborious, especially for complex phylogenetic models of time trees. This bottleneck has led to the search for alternatives, such as variational Bayes, which can scale better to large datasets. In this paper, we introduce torchtree, a framework written in Python that allows developers to easily implement rich phylogenetic models and algorithms using a fixed tree topology. One can either use automatic differentiation, or leverage torchtree's plug-in system to compute gradients analytically for model components for which automatic differentiation is slow. We demonstrate that the torchtree variational inference framework performs similarly to BEAST in terms of speed and approximation accuracy. Furthermore, we explore the use of the forward KL divergence as an optimizing criterion for variational inference, which can handle discontinuous and non-differentiable models. Our experiments show that inference using the forward KL divergence tends to be faster per iteration compared to the evidence lower bound (ELBO) criterion, although the ELBO-based inference may converge faster in some cases. Overall, torchtree provides a flexible and efficient framework for phylogenetic model development and inference using PyTorch.
Torchtree:使用 PyTorch 进行灵活的系统发生模型开发和推断
多年来,贝叶斯推断主要依赖于马尔科夫链蒙特卡罗(MCMC)算法。然而,MCMC 计算起来非常费力,尤其是对于复杂的时间树系统发育模型。这一瓶颈导致人们开始寻找能更好地扩展到大型数据集的替代算法,如变异贝叶斯算法。在本文中,我们介绍了 torchtree,这是一个用 Python 编写的框架,允许开发人员使用固定的树拓扑结构轻松实现丰富的系统发育模型和算法。我们证明了 torchtree 变分推理框架在速度和近似精度方面的表现与 BEAST 相似。此外,我们还探索了使用前向 KL 发散作为变量推理的优化准则,它可以处理不连续和不可微分模型。我们的实验表明,与证据下限(ELBO)准则相比,使用前向 KL 发散进行推理的每次迭代速度更快,尽管基于 ELBO 的推理在某些情况下收敛得更快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信