PapersWithELO
← ICLR 2024 leaderboard

Riemannian Multiclass Logistics Regression for SPD Neural Networks

Ziheng Chen, Yue Song, Gaowen Liu, Ramana Rao Kompella, Xiaojun Wu, Nicu Sebe

graph learningRiemannian manifoldsRiemannian classifiersSPD Neural Networks
39.90100
Fused
band ≈ ±15 pct pts (from σ = 0.30)
46.00100
Mimo
band ≈ ±23 pct pts (from σ = 0.45)
36.10100
DeepSeek
band ≈ ±20 pct pts (from σ = 0.41)

OpenReview ground truth

Rejected

TL;DR — We design Riemannian multiclass logistics regression for SPD networks.

Abstract

Deep neural networks for learning Symmetric Positive Definite (SPD) matrices are gaining increasing attention in machine learning. Despite the significant progress, most existing SPD networks use traditional Euclidean classifiers on approximated spaces rather than intrinsic classifiers that accurately capture the geometry of SPD manifolds. Inspired by the success of Hyperbolic Neural Networks (HNNs), we propose Riemannian multiclass logistics regression (RMLR) for the classification layers in SPD networks. We focus on the metrics pulled back from the Euclidean space, such as Log-Euclidean Metric (LEM) and Log-Cholesky Metric (LCM), and introduce a unified framework for building Riemannian classifiers under these metrics. We first generalize the existing LEM and LCM by the concept of deformation and then design the specific SPD classifiers. Our framework encompasses the most popular LogEig classifier in existing SPD networks as a special case. The effectiveness of our method is demonstrated in three applications: radar recognition, human action recognition, and electroencephalography (EEG) classification.

Author context

Most prolific author: 8 submissions (credibility 1.00).

No mass-submission penalty for this paper (authors within normal submission volume).

Aggregate statistics only — no individual author rankings.

Ranking trajectory

Percentile by tournament round — convergence indicates rating stability.

Judge assessments

Mean overall score 0.0 ± 0.0 (n = 32)