Skip to content

Nested Inductive Bias Framework for SPD Manifold Learning

Sep 2026 · 0 citations · 16 references
Computer Science

TL;DR

This work introduces a Nested Inductive Bias framework that utilizes a two-stage diffeomorphic composition to formally pull back non-Euclidean target geometries onto the SPD manifold, and proposes the Rational Conformal Metric (RCM), designed to establish state-of-the-art geometric robustness against outliers by bounding the representation space.

Abstract

In Geometric Deep Learning, inductive biases serve two primary functions: enforcing manifold constraints and embedding relational priors. Currently, representation learning on SPD manifolds frequently relies on pullback Euclidean metrics, such as the Log-Euclidean Metric, to satisfy the former. While computationally efficient in avoiding domain boundary violations, these metrics induce a flat geometry that may fail to capture the intrinsic relational priors of datasets. While metrics such as the Poincar\'e metric are widely utilized to induce domain-aligned relational priors, generalizing them from standard vector representations to the SPD manifold has remained a challenge. To bridge this gap, we introduce a Nested Inductive Bias framework that utilizes a two-stage diffeomorphic composition to formally pull back non-Euclidean target geometries onto the SPD manifold. This framework enables the construction of curvature-aligned Riemannian classifiers that simultaneously respect matrix constraints and the latent relational geometry of the data. Empirical evaluations on kinematic and signal processing benchmarks, together with synthetic experiments, demonstrate that deep manifold networks experience degradation in class separability unless the metric curvature aligns with the intrinsic data distribution. Furthermore, for standard vectorized architectures, we propose the Rational Conformal Metric (RCM), designed to establish state-of-the-art geometric robustness against outliers by bounding the representation space.

View source

Similar papers

Open access Sep 2026

Mixture of Lie-Group Kernels for Equivariance-Inspired Feature Learning.

MoLiegroup is introduced, a framework that embeds multiple Lie-group priors as specialized kernel experts and adaptively fuses them via a geometry-aware gating mechanism to learn equivariance-inspired geometric features and supplies a practical, architecture-agnostic geometric inductive bias that improves expressivity...

Yao-Xian Yang, Guipeng Lan, Shuai Xiao et al. · 0 citations
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

Dual-Manifold Geometry Guided Representation Learning: Adaptive Coupling between Kernel and Data Spaces

KGFT is proposed, a lightweight module that derives a geometric guidance matrix from the kernel Gram matrix and uses it to transform the covariance structure of feature representations, validating the generality and effectiveness of kernel-guided dual-manifold representation learning.

Wencong Zhang, Yue Zhang, Meiyan Huang et al. · 0 citations
#machine learning Preprint Sep 2026

Geometry-Aware Bayesian Parameter-Efficient Fine-Tuning on the Stiefel Manifold via Stein Variational Gradient Descent

This paper builds on the singular value decomposition factorization of adapters to develop a framework based on Stein variational gradient descent (SVGD), which delivers strong model calibration and attains higher prediction accuracy than SVGD and related uncertainty estimation methods that are formulated in Euclidean...

Quang-Duy Tran, Trung Le, Bao Duong et al. · 0 citations
Preprint Aug 2026

MAGIC-SSCIL: Manifold Anchoring and Geometric Incremental Calibration for Semi-Supervised Class Incremental Learning

MAGIC improves average incremental accuracy over most of the supervised CIL methods equipped with FixMatch and native SSCIL baselines; the largest gains occur in the fine-grained, low-label setting, where confidence thresholding fails most clearly.

Yousef Abdi, Mohammad Asadpour, Y. Seyfari · 0 citations
#artificial intelligence Preprint Sep 2026

Building Transformation Layers for Riemannian Neural Networks

Recently, deep neural networks on manifold-valued representations have garnered significant attention across various machine learning applications. One recent focus is the generalization of Euclidean fully connected (FC) and convolutional layers to non-Euclidean geometries. However, previous approaches typically focus...

Zi-Heng Chen · 1 citation

Related blog posts

MIT News · Artificial Intelligence Oct 23, 2026

Q&A: How AI came to model the “messy” human mind

Assistant Professor Benjamin Lindquist studies how engineers deliberately injected randomness into early AI, giving rise to deep-learning models that sometimes hallucinate.

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