Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry
Ziheng Chen, Yue Song, Xiao-Jun Wu, Gaowen Liu, Nicu Sebe

TL;DR
This paper investigates why matrix function normalizations like logarithm and power improve covariance pooling in deep neural networks, revealing their connection to Riemannian geometry and classifiers on the SPD manifold.
Contribution
It provides a unified Riemannian geometric explanation for matrix function normalizations in covariance pooling, bridging tangent and Riemannian classifiers.
Findings
Matrix functions implicitly respect Riemannian classifiers.
Theoretical analysis aligns with empirical results.
Normalizations improve classification by respecting manifold geometry.
Abstract
Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations. GCP typically performs classification of the covariance matrices by applying matrix function normalization, such as matrix logarithm or power, followed by a Euclidean classifier. However, covariance matrices inherently lie in a Riemannian manifold, known as the Symmetric Positive Definite (SPD) manifold. The current literature does not provide a satisfactory explanation of why Euclidean classifiers can be applied directly to Riemannian features after the normalization of the matrix power. To mitigate this gap, this paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective. The underlying mechanism of matrix functions in GCP is interpreted…
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
Taxonomy
TopicsStatistical and numerical algorithms
