Learning phylogenetic trees as hyperbolic point configurations

04/23/2021
by   Benjamin Wilson, et al.
0

An alternative to independent pairwise distance estimation is proposed that uses hyperbolic geometry to jointly estimate pairwise distances subject to a weakening of the four point condition that characterises tree metrics. Specifically, taxa are represented as points in hyperbolic space such that the distance between a pair of points accounts for the site differences between the corresponding taxa. The proposed algorithm iteratively rearranges the points to increase an objective function that is shown empirically to increase the log-likelihood employed in tree search. Unlike the log-likelihood on tree space, the proposed objective function is differentiable, allowing for the use of gradient-based techniques in its optimisation. It is shown that the error term in the weakened four point condition is bounded by a linear function of the radius parameter of the hyperboloid model, which controls the curvature of the space. The error may thus be made as small as desired, within the bounds of computational precision.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/25/2023

Likelihood Geometry of Determinantal Point Processes

We study determinantal point processes (DPP) through the lens of algebra...
research
06/09/2020

Super-resolution Variational Auto-Encoders

The framework of variational autoencoders (VAEs) provides a principled m...
research
08/29/2022

Generating Regular Hyperbolic Honeycombs

Geodesic regular tree structures are essential to combat numerical preci...
research
07/01/2020

Ultrahyperbolic Representation Learning

In machine learning, data is usually represented in a (flat) Euclidean s...
research
02/13/2020

A quasi-polynomial algorithm for well-spaced hyperbolic TSP

We study the traveling salesman problem in the hyperbolic plane of Gauss...
research
05/29/2019

Global Guarantees for Blind Demodulation with Generative Priors

We study a deep learning inspired formulation for the blind demodulation...
research
10/01/2020

From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering

Similarity-based Hierarchical Clustering (HC) is a classical unsupervise...

Please sign up or login with your details

Forgot password? Click here to reset