5,316 research outputs found
Adaptive Riemannian Metrics on SPD Manifolds
Symmetric Positive Definite (SPD) matrices have received wide attention in
machine learning due to their intrinsic capacity of encoding underlying
structural correlation in data. To reflect the non-Euclidean geometry of SPD
manifolds, many successful Riemannian metrics have been proposed. However,
existing fixed metric tensors might lead to sub-optimal performance for SPD
matrices learning, especially for SPD neural networks. To remedy this
limitation, we leverage the idea of pullback and propose adaptive Riemannian
metrics for SPD manifolds. Moreover, we present comprehensive theories for our
metrics. Experiments on three datasets demonstrate that equipped with the
proposed metrics, SPD networks can exhibit superior performance
Classification via semi-Riemannian spaces
In this paper, we develop a geometric framework for linear or nonlinear discriminant subspace learning and classification. In our framework, the structures of classes are conceptualized as a semi-Riemannian manifold which is considered as a submanifold embedded in an ambient semi-Riemannian space. The class structures of original samples can be characterized and deformed by local metrics of the semi-Riemannian space. Semi-Riemannian metrics are uniquely determined by the smoothing of discrete functions and the nullity of the semi-Riemannian space. Based on the geometrization of class structures, optimizing class structures in the feature space is equivalent to maximizing the quadratic quantities of metric tensors in the semi-Riemannian space. Thus supervised discriminant subspace learning reduces to unsupervised semi-Riemannian manifold learning. Based on the proposed framework, a novel algorithm, dubbed as Semi-Riemannian Discriminant Analysis (SRDA), is presented for subspace-based classification. The performance of SRDA is tested on face recognition (singular case) and handwritten capital letter classification (nonsingular case) against existing algorithms. The experimental results show that SRDA works well on recognition and classification, implying that semi-Riemannian geometry is a promising new tool for pattern recognition and machine learning. 1
Warped Riemannian metrics for location-scale models
The present paper shows that warped Riemannian metrics, a class of Riemannian
metrics which play a prominent role in Riemannian geometry, are also of
fundamental importance in information geometry. Precisely, the paper features a
new theorem, which states that the Rao-Fisher information metric of any
location-scale model, defined on a Riemannian manifold, is a warped Riemannian
metric, whenever this model is invariant under the action of some Lie group.
This theorem is a valuable tool in finding the expression of the Rao-Fisher
information metric of location-scale models defined on high-dimensional
Riemannian manifolds. Indeed, a warped Riemannian metric is fully determined by
only two functions of a single variable, irrespective of the dimension of the
underlying Riemannian manifold. Starting from this theorem, several original
contributions are made. The expression of the Rao-Fisher information metric of
the Riemannian Gaussian model is provided, for the first time in the
literature. A generalised definition of the Mahalanobis distance is introduced,
which is applicable to any location-scale model defined on a Riemannian
manifold. The solution of the geodesic equation is obtained, for any Rao-Fisher
information metric defined in terms of warped Riemannian metrics. Finally,
using a mixture of analytical and numerical computations, it is shown that the
parameter space of the von Mises-Fisher model of -dimensional directional
data, when equipped with its Rao-Fisher information metric, becomes a Hadamard
manifold, a simply-connected complete Riemannian manifold of negative sectional
curvature, for . Hopefully, in upcoming work, this will be
proved for any value of .Comment: first version, before submissio
Riemannian game dynamics
We study a class of evolutionary game dynamics defined by balancing a gain
determined by the game's payoffs against a cost of motion that captures the
difficulty with which the population moves between states. Costs of motion are
represented by a Riemannian metric, i.e., a state-dependent inner product on
the set of population states. The replicator dynamics and the (Euclidean)
projection dynamics are the archetypal examples of the class we study. Like
these representative dynamics, all Riemannian game dynamics satisfy certain
basic desiderata, including positive correlation and global convergence in
potential games. Moreover, when the underlying Riemannian metric satisfies a
Hessian integrability condition, the resulting dynamics preserve many further
properties of the replicator and projection dynamics. We examine the close
connections between Hessian game dynamics and reinforcement learning in normal
form games, extending and elucidating a well-known link between the replicator
dynamics and exponential reinforcement learning.Comment: 47 pages, 12 figures; added figures and further simplified the
derivation of the dynamic
- …