Relative Optimality Conditions and Algorithms for Treespace Fréchet Means
From MaRDI portal
Publication:4637500
DOI10.1137/15M1050914zbMATH Open1395.90239arXiv1411.2923OpenAlexW2963237466MaRDI QIDQ4637500FDOQ4637500
Authors: Sean Skwerer, Scott Provan, J. S. Marron 
Publication date: 24 April 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Abstract: Recent interest in treespaces as well-founded mathematical domains for phylogenetic inference and statistical analysis for populations of anatomical trees has motivated research into efficient and rigorous methods for optimization problems on treespaces. A central problem in this area is computing an average of phylogenetic trees, which is equivalently characterized as the minimizer of the Fr'echet function. The Fr'echet mean can be used for statistical inference and exploratory data analysis: for example it can be leveraged as a test statistic to compare groups via permutation tests, or to find trends in data over time via kernel smoothing. By analyzing the differential properties of the Fr'echet function along geodesics in treespace we obtained a theorem describing a decomposition of the derivative along a geodesic. This decomposition theorem is used to formulate optimality conditions which are used as a logical basis for an algorithm to verify relative optimality at points where the Fr'echet function gradient does not exist.
Full work available at URL: https://arxiv.org/abs/1411.2923
Recommendations
- scientific article; zbMATH DE number 5172313
- Optimal trees for functions of internal distance
- scientific article; zbMATH DE number 1192315
- scientific article; zbMATH DE number 177344
- The tree and forest spaces with applications to initial-value problem methods
- On explicit and Fréchet-optimal lower bounds
- Publication:4945832
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Optimality of the methods for approximating the feasible criterion set in the convex case
Cites Work
- Geometry of the space of phylogenetic trees
- Polyhedral computational geometry for averaging metric phylogenetic trees
- Monotone Operators and the Proximal Point Algorithm
- The proximal point algorithm in metric spaces
- Convex analysis and optimization in Hadamard spaces
- Monotone vector fields and the proximal point algorithm on Hadamard manifolds
- Title not available (Why is that?)
- Computing medians and means in Hadamard spaces
- Incremental proximal methods for large scale convex optimization
- Statistical approach to tests involving phylogenies
- Statistics for phylogenetic trees
- Title not available (Why is that?)
- Relative Optimality Conditions and Algorithms for Treespace Fréchet Means
- Tree-oriented analysis of brain artery structure
Cited In (7)
- Old and new challenges in Hadamard spaces
- Relative Optimality Conditions and Algorithms for Treespace Fréchet Means
- Fréchet mean set estimation in the Hausdorff metric, via relaxation
- Computing medians and means in Hadamard spaces
- Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace
- Limiting behaviour of Fréchet means in the space of phylogenetic trees
- Uncertainty in Phylogenetic Tree Estimates
Uses Software
This page was built for publication: Relative Optimality Conditions and Algorithms for Treespace Fréchet Means
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637500)
