The Geometry of Algorithms with Orthogonality Constraints
SIAM Journal on Matrix Analysis and Applications
Multivariate normal distributions parametrized as a Riemannian symmetric space
Journal of Multivariate Analysis
Convex Optimization
A Differential Geometric Approach to the Geometric Mean of Symmetric Positive-Definite Matrices
SIAM Journal on Matrix Analysis and Applications
Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection
The Journal of Machine Learning Research
A Riemannian Framework for Tensor Computing
International Journal of Computer Vision
Means of Positive Numbers and Matrices
SIAM Journal on Matrix Analysis and Applications
Learning low-rank kernel matrices
ICML '06 Proceedings of the 23rd international conference on Machine learning
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements
Journal of Mathematical Imaging and Vision
Matrix Nearness Problems with Bregman Divergences
SIAM Journal on Matrix Analysis and Applications
A geometric newton method for oja's vector field
Neural Computation
Optimization Algorithms on Matrix Manifolds
Optimization Algorithms on Matrix Manifolds
Journal of Mathematical Imaging and Vision
Covariance, subspace, and intrinsic Crame´r-Rao bounds
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
This paper introduces a new metric and mean on the set of positive semidefinite matrices of fixed-rank. The proposed metric is derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric. The resulting Riemannian space has strong geometrical properties: it is geodesically complete, and the metric is invariant with respect to all transformations that preserve angles (orthogonal transformations, scalings, and pseudoinversion). A meaningful approximation of the associated Riemannian distance is proposed, that can be efficiently numerically computed via a simple algorithm based on SVD. The induced mean preserves the rank, possesses the most desirable characteristics of a geometric mean, and is easy to compute.