Riemannian Deep Learning: Modules, Networks, and Geometries
arXiv:2607.19305
2026
Geometry
2 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper provides reusable intrinsic neural modules for non-Euclidean representations, with the clearest transfer opportunities being its unconstrained proper-velocity parameterization of hyperbolic space and its Cholesky-factorized SPD geometry. Proper velocity removes the Lorentz hyperboloid constraint from the learnable spatial tensor, allowing ordinary affine maps and activations while reconstructing the time coordinate analytically. The SPD construction replaces expensive eigendecomposition-based operators with lower-triangular and diagonal operations, making covariance-aware residual blocks and classifiers more practical. These ideas are most promising as drop-in replacements for constrained hyperbolic layers and as efficient covariance-aware heads for vision, graph, and sequence models.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Build an SPD classifier and residual head directly from Cholesky factors, using lower-triangular differences and matrix-power terms instead of generic eigendecomposition-based logarithm operators. This retains covariance geometry while making positive-definiteness automatic and backpropagation more numerically stable for minibatch training.
Useful7/10
Difficulty6/10
Novelty7/10
✗ Mechanism failed
2026
Replace Lorentz-hyperboloid tensors with proper-velocity tensors whose spatial coordinates can be transformed by standard Euclidean affine layers and activations. Reconstruct the Lorentz time coordinate only at manifold boundaries, preserving the hyperbolic representation while avoiding repeated projection, normalization, or fragile exponential-map calculations.
Useful7/10
Difficulty4/10
Novelty6/10