Skip to content

$\mathbb{SL}(n)$ Representation Learning: An Intrinsic Mixed-Curvature Space with Higher Curvature Capacities and Deeper Order-Aware Composition

Sep 2026 · 0 citations · 43 references
Computer Science

TL;DR

The $\mathbb{SL}(n)$ space is introduced, a representation geometry defined by the simple $\det(A)=1$ constraint and a left invariant Schatten-$p$ Finsler structure that consistently outperforms a broad range of representation manifold baselines across graph benchmarks at different scales.

Abstract

Mixed-curvature representation learning seeks to capture rich geometric structures that cannot be adequately modeled by a single curvature regime. Existing approaches largely rely on product manifolds, which require manually specifying how different curvature spaces are combined and separate their curvature contributions across factors. We introduce the $\mathbb{SL}(n)$ space, a representation geometry defined by the simple $\det(A)=1$ constraint and a left invariant Schatten-$p$ Finsler structure. Despite this minimal construction, $\mathbb{SL}(n)$ exhibits pointwise negative, zero, and positive flag curvature around a common flagpole, while its mixed-curvature and curvature-coupling capacities are asymptotically maximal relative to the intrinsic geometric upper bound. Beyond geometry, its noncommutative group structure provides inherent order sensitivity, and its non-nilpotent Lie algebra admits nonzero nested Lie brackets at arbitrary depth, enabling deep order-aware composition. Empirically, $\mathbb{SL}(n)$ consistently outperforms a broad range of representation manifold baselines across graph benchmarks at different scales. It reduces average distortion over the strongest baselines by $44.3\%$ on KEGG and $40.5\%$ on HumanCyc, and improves Hits@20 by $42.8\%$ on OGBL-PPA. Experiments on Flickr30k-Order further support its ability to capture higher order dependencies from ordered composition. Together, these results show how a seemingly simple structural constraint can yield unexpectedly rich geometry, capacity, and composition within a unified representation space.

View source

Similar papers

Preprint Sep 2026

Minkowski Attractor Networks: Closed-Form Hyperbolic Flows for Visual Representations

Geometric representation learning predominantly scaffolds representations onto flat Euclidean subspaces or compact product tori ($\mathbb{T}^K$). However, flat manifolds possess vanishing curvature and polynomial volume growth, inherently suffering from metric distortion when embedding multi-scale, tree-like visual hie...

Zhong-Ping Ji · 1 citation
Preprint Aug 2026

Equivariant Covariance Tensors: Guaranteed SPD Uncertainty for Tensor-Valued Geometric Learning

A framework for E(3)-equivariant UQ is introduced, modeling the full predictive distribution where both mean and covariance preserve rotational symmetry, and a Log-Euclidean Equivariant Scoring Objective (LE-ESO) is formulated, a robust surrogate loss based on the Multivariate Laplace distribution providing robustness...

Rui-Han Liu, Yun-Ting Ji, Jian-Bo Yu et al. · 0 citations
Preprint Aug 2026

A Generalized Ridge Regression and Convolutional LASSO

It is proved that the extracted trend is invariant across representations, and a closed-form Bregman-type divergence quantifying their disagreement under a shared coefficient vector is obtained, and this divergence vanishes as $\lambda\to\infty$.

Shintaro Yoshizawa · 0 citations
Preprint Aug 2026

K\"ahler landscapes for complex neural network descents and guarantees including a search and destroy of the Calabi-Yau manifold

We study landscapes for complex-parameterized networks. Our approach is motivated with an information-theoretic manifold perspective of the parameter and via classical optimization guarantees although of complex geometric variety such as through Dolbeault asymptotics. The descent path admits a K\"ahler information metr...

Andrew Gracyk · 0 citations
#graph neural networks Open access Sep 2026

Distance-Based Representation Learning with Nonlinear Feature Algebras

A framework grounded in coarse geometry, the branch of mathematics studying metric spaces up to quasi-isometry is proposed: features are nonlinear functions of the distances from each point to a set of anchor points, so they read global geometry directly rather than through local aggregation.

K. Enakoutsa · 0 citations
#machine learning Preprint Aug 2026

Sample-Weighted End-to-End Trace-Norm Geometry for Multitask Learning

The sample-size-weighted trace norm of the end-to-end map from task coefficients to input-space predictors is studied instead the sample-size-weighted trace norm of the end-to-end map from task coefficients to input-space predictors.

Mahdi Mohammadigohari · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.