Search arXivSearch

arXiv · 2504.11201

Projected Gradient Descent Method for Tropical Principal Component Analysis over Tree Space

Abstract

In 2019, Yoshida et al. developed tropical Principal Component Analysis (PCA), that is, an analogue of the classical PCA in the setting of tropical geometry and applied it to visualize a set of gene trees over a space of phylogenetic trees which is an union of lower dimensional polyhedral cones in an Euclidean space with its dimension $m(m-1)/2$ where $m$ is the number of leaves. In this paper, we introduce a projected gradient descent method to estimate the tropical principal polytope over the space of phylogenetic trees and we apply it to apicomplexa dataset. With computational experiment against Markov Chain Monte Carlo (MCMC) samplers, we show that our projected gradient descent has a lower sum of tropical distances between observations and their projections on an estimated best-fit tropical polytope compared with the MCMC approach proposed by Page et al.~in 2020.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruriko Yoshida. 2025-05-22. Projected Gradient Descent Method for Tropical Principal Component Analysis over Tree Space. https://arxiv.org/abs/2504.11201

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO