Skip to content

Group Invariant Spectral Embedding

Jul 2026 · arXiv.org · Vol abs/2607.08987 · 0 citations · 61 references
Computer Science Mathematics

TL;DR

This work analyzes the case of a Riemannian data manifold with symmetries given by a compact Lie group~G and proves that, under suitable conditions, graph Laplacians constructed from three types of invariant kernels converge pointwise to explicit second-order differential operators on the quotient space $M/G$.

Abstract

Spectral embedding methods are widely used for dimensionality reduction and clustering of high-dimensional datasets with intrinsic low-dimensional structures. Although many datasets of practical interest exhibit invariance under symmetries such as rotations, standard spectral embedding methods do not account for this, treating symmetry-related data points as unrelated. Our approach to this problem is to incorporate the symmetries directly into the affinity kernels used for spectral embedding. We analyze the case of a Riemannian data manifold $M$ with symmetries given by a compact Lie group~$G$ and prove that, under suitable conditions, graph Laplacians constructed from three types of invariant kernels converge pointwise to explicit second-order differential operators on the quotient space $M/G$. Our analysis implies improved convergence rates, as the effective dimension drops according to the dimension of the group. We validate our approach on datasets with $\mathrm{SO}(2)$ or $\mathrm{SO}(3)$ symmetry, and show that $G$-invariant spectral embedding recovers the intrinsic geometry of the data, in contrast to standard spectral embedding, which fails to do so even in the limit of infinite data.

View source

Similar papers

Preprint Aug 2026

Density Estimation on Compact Manifolds under Intrinsic Spectral Block Variation

We introduce an intrinsic spectral sparsity model for nonparametric density estimation on compact connected Riemannian manifolds. Instead of penalizing coefficients in an arbitrarily chosen Laplace--Beltrami eigenbasis, we group each complete eigenspace and measure the Hilbert norm of its spectral component. The result...

Olga Klopp, Fedor Noskov · 0 citations
#machine learning Preprint Sep 2026

Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

The Gaussian kernel is a widely used similarity measure underlying kernel methods such as kernel PCA and spectral clustering, but computing Gaussian kernel distances for many pairs of points can be expensive. Using Random Fourier Features (RFF), Chen and Phillips [ALT 2017] showed that for points in a $d$-dimensional E...

Soumik Dutta, Kunal Dutta · 0 citations
Preprint Aug 2026

Shape Operator PCA: Curvature-Aware Projections for Geometric Machine Learning

In this paper, we propose SHOPCA (Shape Operator-based Principal Component Analysis), a novel method for unsupervised metric learning and dimensionality reduction that incorporates differential geometric information into the covariance structure of classical PCA. SHOPCA regularizes the global covariance matrix using th...

A. L. M. Levada · 0 citations
Jul 2026

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

Spectral methods are among the most widely used techniques for community detection, clustering, and graph learning. Their performance, however, critically depends on the accurate estimation of the underlying spectral subspace and can deteriorate substantially in the presence of noise, outliers, or model perturbations....

Zhuan Liang, Zheng Zhai · 0 citations
Preprint Aug 2026

A Weighted Discretization of Riemannian Manifolds with Lower Ricci Bounds

Let $(M,g)$ be a connected, compact, $n$-dimensional Riemannian manifold with $\operatorname{Ric}(M,g)\geq-(n-1)\kappa g$. We introduce a weighted combinatorial Laplacian on $\varepsilon$-discretizations of $M$ and prove a spectral comparison theorem between the weighted graph Laplacian and the Laplace-Beltrami operato...

Aditya Tiwari · 0 citations
Aug 2026

Random features for Grassmannian kernel approximation with bounded rank-one projections

It is shown that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces, which accurately preserve Grassmannian geometry while reducing computation, memory, and storage.

Rémi Delogne, L. Jacques · 0 citations

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