Differential geometry with extreme eigenvalues in the positive semidefinite cone
Not on the map. Why?
Abstract (arXiv)
Differential geometric approaches to the analysis and processing of data in the form of symmetric positive definite (SPD) matrices have had notable successful applications to numerous fields including computer vision, medical imaging, and machine learning. The dominant geometric paradigm for such applications has consisted of a few Riemannian geometries associated with spectral computations that are costly at high scale and in high dimensions. We present a route to a scalable geometric framework for the analysis and processing of SPD-valued data based on the efficient computation of extreme generalized eigenvalues through the Hilbert and Thompson geometries of the semidefinite cone. We explore a particular geodesic space structure based on Thompson geometry in detail and establish several properties associated with this structure. Furthermore, we define a novel iterative mean of SPD matrices based on this geometry and prove its existence and uniqueness for a given finite collection of points. Finally, we state and prove a number of desirable properties that are satisfied by this mean.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 18 of its 68 references that are in the map. First posted on arXiv 14 Apr 2023.
Builds on
18 of 68 references.
References · 18
- 2016A Riemannian Network for SPD Matrix Learningcited by 162
- 2013Manopt, a Matlab toolbox for optimization on manifoldscited by 112
- 2019Riemannian batch normalization for SPD neural networkscited by 72
- 2018geomstats: a Python Package for Riemannian Geometry in Machine Learningcited by 71
- 2014Kernel Methods on Riemannian Manifolds with Gaussian RBF Kernelscited by 30
- 2015Riemannian Dictionary Learning and Sparse Coding for Positive Definite Matricescited by 24
- 2016Geometric Mean Metric Learningcited by 22
- 2022Tensor-CSPNet: A Novel Geometric Deep Learning Framework for Motor Imagery Classificationcited by 21
- 2017Clustering Signed Networks with the Geometric Mean of Laplacianscited by 11
- 2016Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysiscited by 10
- 2016Geometry-aware Similarity Learning on SPD Manifolds for Visual Recognitioncited by 9
- 2020Hilbert geometry of the Siegel disk: The Siegel-Klein disk modelcited by 7
6 more
- 2019Geometric Matrix Midrangescited by 3
- 2020Inductive Geometric Matrix Midrangescited by 3
- 2021Online learning of Riemannian hidden Markov models in homogeneous Hadamard spacescited by 3
- 2017Conal Distances Between Rational Spectral Densitiescited by 2
- 2022Geometric Learning of Hidden Markov Models via a Method of Moments Algorithmcited by 2
- 2022Affine-Invariant Midrange Statisticscited by 1
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 1.
5 papers.
- 2025SPD Matrix Learning for Neuroimaging Analysis: Perspectives, Methods, and Challengescited by 5
- 2024Approximation and bounding techniques for the Fisher-Rao distances between parametric statistical modelscited by 2
- 2025Hilbert geometry of the symmetric positive-definite bicone: Application to the geometry of the extended Gaussian familycited by 2
- 2024Geometric statistics with subspace structure preservation for SPD matricescited by 0
- 2026Geometric structures and deviations on James' symmetric positive-definite matrix bicone domaincited by 0
- 2026Geometric structures and deviations on James' symmetric positive-definite matrix bicone domain3 Mar 2026
- 2025Hilbert geometry of the symmetric positive-definite bicone: Application to the geometry of the extended Gaussian family20 Aug 2025
- 2025SPD Matrix Learning for Neuroimaging Analysis: Perspectives, Methods, and Challenges26 Apr 2025
- 2024Geometric statistics with subspace structure preservation for SPD matrices2 Jul 2024
- 2024Approximation and bounding techniques for the Fisher-Rao distances between parametric statistical models15 Mar 2024