Ruriko Yoshida
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ruriko Yoshida has a total of 73 co-authors. Here are the top co-authors by number of shared publications:
- Keiji Miura
Department of Biosciences, Kwansei Gakuin University, Sanda, Japan
9 shared publications - Anthea Monod
Imperial College London
4 shared publications - David Barnhill
Mathematics Department, US Naval Academy, Annapolis, MD, United States
4 shared publications - Chrysafis Vogiatzis
Industrial and Enterprise Systems Engineering, University of Illinois Urbana-Champaign, Urbana, USA
3 shared publications - Georgios Aliatimis
STOR-i Centre for Doctoral Training, Lancaster University, Lancaster, UK
3 shared publications Shelby Cox
3 shared publications
Latest Publications
- Open Access
- 28 July 2026
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (4) , 2220-2242
Tropical Fermat–Weber Polytropes
We study the geometry of tropical Fermat–Weber points, that is, optimal solutions to a location problem over a projective space using a dissimilarity measure derived from the tropical metric. It is well-known that for a given sample, such points are not necessarily unique, and we show that the set of all possible Fermat–Weber points forms a polytrope. This follows from the fact that our location problem turns out to be dual to a particular minimum-cost flow problem, and we describe the polytrope of optimal locations in the terminology of tropical geometry. We also provide a simple gradient descent algorithm that converges to the Fermat–Weber polytrope.
- 28 July 2026
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 76 (4) , 2220-2242
Open AccessTropical Fermat–Weber Polytropes
We study the geometry of tropical Fermat–Weber points, that is, optimal solutions to a location problem over a projective space using a dissimilarity measure derived from the tropical metric. It is well-known that for a given sample, such points are not necessarily unique, and we show that the set of all possible Fermat–Weber points forms a polytrope. This follows from the fact that our location problem turns out to be dual to a particular minimum-cost flow problem, and we describe the polytrope of optimal locations in the terminology of tropical geometry. We also provide a simple gradient descent algorithm that converges to the Fermat–Weber polytrope.
- Open Access
- 14 July 2026
- Published by Springer Nature in Vietnam Journal of Mathematics
Tropical Geometry of Phylogenetic Tree Space: A statistical Perspective
Phylogenetic trees are the fundamental mathematical representation of evolutionary processes in biology. They are also objects of interest in pure mathematics, such as algebraic geometry and combinatorics, due to their discrete geometry. Although they are important data structures, they face the significant challenge that sets of trees form a non-Euclidean phylogenetic tree space, which means that standard computational and statistical methods cannot be directly applied. In this work, we explore the statistical feasibility of a pure mathematical representation of the set of all phylogenetic trees based on tropical geometry for both descriptive and inferential statistics, and unsupervised and supervised machine learning. Our exploration is both theoretical and practical. We show that the tropical geometric phylogenetic tree space endowed with a generalized Hilbert projective metric exhibits analytic, geometric, and topological properties that are desirable for theoretical studies in probability and statistics and allow for well-defined questions to be posed. We illustrate the statistical feasibility of the tropical geometric perspective for phylogenetic trees with an example of both a descriptive and inferential statistical task. Moreover, this approach exhibits increased computational efficiency and statistical performance over the current state-of-the-art, which we illustrate with a real data example on seasonal influenza. Our results demonstrate the viability of the tropical geometric setting for parametric statistical and probabilistic studies of sets of phylogenetic trees.
- 14 July 2026
- Published by Springer Nature in Vietnam Journal of Mathematics
Open AccessTropical Geometry of Phylogenetic Tree Space: A statistical Perspective
Phylogenetic trees are the fundamental mathematical representation of evolutionary processes in biology. They are also objects of interest in pure mathematics, such as algebraic geometry and combinatorics, due to their discrete geometry. Although they are important data structures, they face the significant challenge that sets of trees form a non-Euclidean phylogenetic tree space, which means that standard computational and statistical methods cannot be directly applied. In this work, we explore the statistical feasibility of a pure mathematical representation of the set of all phylogenetic trees based on tropical geometry for both descriptive and inferential statistics, and unsupervised and supervised machine learning. Our exploration is both theoretical and practical. We show that the tropical geometric phylogenetic tree space endowed with a generalized Hilbert projective metric exhibits analytic, geometric, and topological properties that are desirable for theoretical studies in probability and statistics and allow for well-defined questions to be posed. We illustrate the statistical feasibility of the tropical geometric perspective for phylogenetic trees with an example of both a descriptive and inferential statistical task. Moreover, this approach exhibits increased computational efficiency and statistical performance over the current state-of-the-art, which we illustrate with a real data example on seasonal influenza. Our results demonstrate the viability of the tropical geometric setting for parametric statistical and probabilistic studies of sets of phylogenetic trees.
- Open Access
- 4 July 2026
- Published by Springer Nature in BMC Bioinformatics
- Vol. 27 (1)
Covariance decomposition for distance based species tree estimation
In phylogenomics, species-tree methods must contend with two major sources of noise; stochastic gene-tree variation under the multispecies coalescent model (MSC) and finite-sequence substitutional noise. Fast agglomerative methods such as GLASS, STEAC, and METAL combine multi-locus information via distance-based clustering. We derive the exact covariance matrix of these pairwise distance estimates under a joint MSC-plus-substitution model and leverage it for reliable confidence estimation, and we algebraically decompose it into components attributable to coalescent variation versus sequence-level stochasticity. Our theory identifies parameter regimes where one source of variance greatly exceeds the other. For both very low and very high mutation rates, substitutional noise dominates, while coalescent variance is the primary contributor at intermediate mutation rates. Moreover, the interval over which coalescent variance dominates becomes narrower as the species-tree height increases. These results imply that in some settings one may legitimately ignore the weaker noise source when designing methods or collecting data. In particular, when gene-tree variance is dominant, adding more loci is most beneficial, while when substitution noise dominates, longer sequences or imputation are needed. Finally, leveraging the derived covariance matrix, we implement a Gaussian-sampling procedure to generate split support values for METAL trees and demonstrate empirically that this approach yields more reliable confidence estimates than traditional bootstrapping.
- 4 July 2026
- Published by Springer Nature in BMC Bioinformatics
- Vol. 27 (1)
Open AccessCovariance decomposition for distance based species tree estimation
In phylogenomics, species-tree methods must contend with two major sources of noise; stochastic gene-tree variation under the multispecies coalescent model (MSC) and finite-sequence substitutional noise. Fast agglomerative methods such as GLASS, STEAC, and METAL combine multi-locus information via distance-based clustering. We derive the exact covariance matrix of these pairwise distance estimates under a joint MSC-plus-substitution model and leverage it for reliable confidence estimation, and we algebraically decompose it into components attributable to coalescent variation versus sequence-level stochasticity. Our theory identifies parameter regimes where one source of variance greatly exceeds the other. For both very low and very high mutation rates, substitutional noise dominates, while coalescent variance is the primary contributor at intermediate mutation rates. Moreover, the interval over which coalescent variance dominates becomes narrower as the species-tree height increases. These results imply that in some settings one may legitimately ignore the weaker noise source when designing methods or collecting data. In particular, when gene-tree variance is dominant, adding more loci is most beneficial, while when substitution noise dominates, longer sequences or imputation are needed. Finally, leveraging the derived covariance matrix, we implement a Gaussian-sampling procedure to generate split support values for METAL trees and demonstrate empirically that this approach yields more reliable confidence estimates than traditional bootstrapping.
- 28 March 2026
- Published by Springer Nature in Vietnam Journal of Mathematics
Tropical Fermat–Weber Points over Spaces of M-Ultrametrics
- 28 March 2026
- Published by Springer Nature in Vietnam Journal of Mathematics
Tropical Fermat–Weber Points over Spaces of M-Ultrametrics
- Open Access
- 21 January 2026
- Published by Elsevier in Neural Networks
- Vol. 199, 108624
Adversarially robust neural network decision boundaries via tropical geometry
- 21 January 2026
- Published by Elsevier in Neural Networks
- Vol. 199, 108624
Open AccessAdversarially robust neural network decision boundaries via tropical geometry
- Open Access
Bandwidth Selection of Density Estimators over Treespaces
A kernel density estimator (KDE) is one of the most popular non-parametric density estimators. In this paper we focus on a best bandwidth selection method for use in an analogue of a classical KDE using the tropical symmetric distance, known as a tropical KDE, for use over the space of phylogenetic trees. We propose the likelihood cross validation (LCV) for selecting the bandwidth parameter for the KDE over the space of phylogenetic trees. In this paper, first, we show the explicit optimal solution of the best-fit bandwidth parameter via the LCV for tropical KDE over the space of phylogenetic trees. Then, computational experiments with simulated datasets generated under the multi-species coalescent (MSC) model show that a tropical KDE with the best-fit bandwidth parameter via the LCV perform better than a tropical KDE with an estimated best-fit bandwidth parameter via nearest neighbors in terms of accuracy and computational time. Lastly, we apply our method an empirical data from the Apicomplexa genome.
Open AccessBandwidth Selection of Density Estimators over Treespaces
A kernel density estimator (KDE) is one of the most popular non-parametric density estimators. In this paper we focus on a best bandwidth selection method for use in an analogue of a classical KDE using the tropical symmetric distance, known as a tropical KDE, for use over the space of phylogenetic trees. We propose the likelihood cross validation (LCV) for selecting the bandwidth parameter for the KDE over the space of phylogenetic trees. In this paper, first, we show the explicit optimal solution of the best-fit bandwidth parameter via the LCV for tropical KDE over the space of phylogenetic trees. Then, computational experiments with simulated datasets generated under the multi-species coalescent (MSC) model show that a tropical KDE with the best-fit bandwidth parameter via the LCV perform better than a tropical KDE with an estimated best-fit bandwidth parameter via nearest neighbors in terms of accuracy and computational time. Lastly, we apply our method an empirical data from the Apicomplexa genome.
- Open Access
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 240-248
Tropical Fréchet Means
- 28 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 240-248
Open AccessTropical Fréchet Means
- Open Access
- 27 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1776
Projected Gradient Descent Method for Tropical Principal Component Analysis over Tree Space
Tropical Principal Component Analysis (PCA) 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 a union of lower-dimensional polyhedral cones in an Euclidean space with dimension , 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 an Apicomplexa dataset. With computational experiments against Markov Chain Monte Carlo (MCMC) samplers, we show that our projected gradient descent method yields a lower sum of tropical distances between observations and their projections onto the estimated best-fit tropical polytope, compared with the MCMC-based approach.- 27 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1776
Open AccessProjected Gradient Descent Method for Tropical Principal Component Analysis over Tree Space
Tropical Principal Component Analysis (PCA) 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 a union of lower-dimensional polyhedral cones in an Euclidean space with dimension , 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 an Apicomplexa dataset. With computational experiments against Markov Chain Monte Carlo (MCMC) samplers, we show that our projected gradient descent method yields a lower sum of tropical distances between observations and their projections onto the estimated best-fit tropical polytope, compared with the MCMC-based approach. - Open Access
Inference for max-linear Bayesian networks with noise
Max-Linear Bayesian Networks (MLBNs) provide a powerful framework for causal inference in extreme-value settings; we consider MLBNs with noise parameters with a given topology in terms of the max-plus algebra by taking its logarithm. Then, we show that an estimator of a parameter for each edge in a directed acyclic graph (DAG) is distributed normally. We end this paper with computational experiments with the expectation and maximization (EM) algorithm and quadratic optimization.
Open AccessInference for max-linear Bayesian networks with noise
Max-Linear Bayesian Networks (MLBNs) provide a powerful framework for causal inference in extreme-value settings; we consider MLBNs with noise parameters with a given topology in terms of the max-plus algebra by taking its logarithm. Then, we show that an estimator of a parameter for each edge in a directed acyclic graph (DAG) is distributed normally. We end this paper with computational experiments with the expectation and maximization (EM) algorithm and quadratic optimization.
- Open Access
- 5 October 2024
- Published by Mathematical Sciences Publishers in Journal of Software for Algebra and Geometry
- Vol. 14 (1) , 133-174
Tropical geometric tools for machine learning: the TML package
In the last decade, developments in tropical geometry have provided a number of uses directly applicable to problems in statistical learning. The TML package is the first R package which contains a comprehensive set of tools and methods used for basic computations related to tropical convexity, visualization of tropically convex sets, as well as supervised and unsupervised learning models using the tropical metric under the max-plus algebra over the tropical projective torus. Primarily, the TML package employs a Hit-and-Run Markov chain Monte Carlo sampler in conjunction with the tropical metric as its main tool for statistical inference. In addition to basic computation and various applications of the tropical HAR sampler, we also focus on several supervised and unsupervised methods incorporated in the TML package including tropical principal component analysis, tropical logistic regression and tropical kernel density estimation.
- 5 October 2024
- Published by Mathematical Sciences Publishers in Journal of Software for Algebra and Geometry
- Vol. 14 (1) , 133-174
Open AccessTropical geometric tools for machine learning: the TML package
In the last decade, developments in tropical geometry have provided a number of uses directly applicable to problems in statistical learning. The TML package is the first R package which contains a comprehensive set of tools and methods used for basic computations related to tropical convexity, visualization of tropically convex sets, as well as supervised and unsupervised learning models using the tropical metric under the max-plus algebra over the tropical projective torus. Primarily, the TML package employs a Hit-and-Run Markov chain Monte Carlo sampler in conjunction with the tropical metric as its main tool for statistical inference. In addition to basic computation and various applications of the tropical HAR sampler, we also focus on several supervised and unsupervised methods incorporated in the TML package including tropical principal component analysis, tropical logistic regression and tropical kernel density estimation.