mlsanityData to 7 Oct 2026

Probabilistic Learning Vector Quantization on Manifold of Symmetric Positive Definite Matrices

arXiv 2102.00667 ↗First posted 1 Feb 2021cs.LG stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we develop a new classification method for manifold-valued data in the framework of probabilistic learning vector quantization. In many classification scenarios, the data can be naturally represented by symmetric positive definite matrices, which are inherently points that live on a curved Riemannian manifold. Due to the non-Euclidean geometry of Riemannian manifolds, traditional Euclidean machine learning algorithms yield poor results on such data. In this paper, we generalize the probabilistic learning vector quantization algorithm for data points living on the manifold of symmetric positive definite matrices equipped with Riemannian natural metric (affine-invariant metric). By exploiting the induced Riemannian distance, we derive the probabilistic learning Riemannian space quantization algorithm, obtaining the learning rule through Riemannian gradient descent. Empirical investigations on synthetic data, image data , and motor imagery EEG data demonstrate the superior performance of the proposed method.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 37 references that are in the map. First posted on arXiv 1 Feb 2021.

Builds on

4 of 37 references.

References · 4

  1. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  2. 2014Kernel Methods on Riemannian Manifolds with Gaussian RBF Kernelscited by 30
  3. 2015A review of learning vector quantization classifierscited by 11
  4. 2015Riemannian Metric Learning for Symmetric Positive Definite Matricescited by 8

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.