Finsler Metric Clustering in Weighted Projective Spaces
Tony Shaska

TL;DR
This paper introduces a Finsler metric-based hierarchical clustering framework for weighted projective spaces, ensuring metric properties and stability, with applications in arithmetic geometry, dynamics, and quantum state analysis.
Contribution
It develops a true metric Finsler geometry approach for clustering in weighted projective spaces, overcoming limitations of previous dissimilarity measures and preserving intrinsic symmetries.
Findings
Proves the Finsler-derived distance satisfies the triangle inequality.
Demonstrates stability of clustering via Gromov-Hausdorff distance.
Shows applicability in arithmetic geometry and quantum state analysis.
Abstract
This paper establishes a foundational framework for geometric learning in weighted projective spaces by introducing a hierarchical clustering algorithm governed by Finsler geometry. We define a scaling-invariant Finsler metric -and its rational analogue -derived from an optimization-based Finsler norm that effectively quotients out the weighted scaling action. Unlike previous approaches that characterized these spaces via non-metric dissimilarity measures, we rigorously prove that our construction satisfies the triangle inequality, providing a true metric framework that ensures the stability of hierarchical clustering via the Gromov-Hausdorff distance. We demonstrate that this metric approach preserves the intrinsic scaling symmetries and weighted topology of without the topological…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Graph Neural Networks · Tensor decomposition and applications
