Skip to content
Preprint

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

Aug 2026 · 0 citations · 33 references
Computer Science Mathematics

TL;DR

SHOPCA is computationally tractable, parameter-efficient, and applicable to domains requiring fully unsupervised, geometry-aware dimensionality reduction, and surpasses UMAP on small-sample settings, where iterative neighborhood-based manifold estimation can degrade.

Abstract

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 the mean shape operator, defined as the average of the absolute local shape operators estimated from the data manifold, steering principal components toward directions of both maximum variance and informative curvature. A single trace-normalized mixing coefficient $\alpha$ controls the regularization, recovering standard PCA at $\alpha = 0$ and a curvature-driven embedding as $\alpha \to \infty$. We further introduce a fully unsupervised criterion for selecting $\alpha$ based on the spectral eigengap of the regularized covariance matrix, maximizing the relative separation between the top-$d$ and remaining eigenvalues without using class labels. We evaluate SHOPCA on more than 50 real-world benchmark datasets, comparing it with PCA, ISOMAP, and UMAP using Adjusted Rand Index (ARI), Normalized Mutual Information (NMI), Fowlkes-Mallows index (FM), and V-measure. Results show that SHOPCA consistently improves clustering quality over PCA across a broad range of datasets and surpasses UMAP on small-sample settings, where iterative neighborhood-based manifold estimation can degrade. SHOPCA is computationally tractable, parameter-efficient, and applicable to domains requiring fully unsupervised, geometry-aware dimensionality reduction.

View source

Similar papers

#machine learning Preprint Sep 2026

Riemannian Difference-of-Convex Optimization for K-Means Clustering

This paper replaces the cardinality constraint with a difference-of-convex (DC) penalty and establishes a global error bound to prove that the penalized and constrained formulations share the same global minimizers whenever the penalty parameter exceeds a finite threshold.

Meng Xu, Bo Jiang, Han-Fu Zhang et al. · 0 citations
#diffusion models Open access Sep 2026

A new perspective on centroid algorithms for unsupervised discrete clustering in Riemannian manifolds: an approach via optimization

This work presents a new perspective on a specific class of partition-based algorithms for unsupervised discrete clustering in complete finite-dimensional Riemannian manifolds by introducing statistical shape analyses to classify clusters and improve label selection.

Ronaldo Malheiros Gregorio, Charlan Dellon da Silva Alves, Sérgio Assunção Monteiro et al. · 0 citations
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
Preprint Sep 2026

Geometric Fluctuations of the $\sin\Theta$ Distance in High-Dimensional Principal Subspace Estimation

We investigate the geometric fluctuations of principal subspaces for high-dimensional covariance matrices through the squared Frobenius $\sin\Theta$ distance between the sample and population eigenspaces associated with the $r_p$ largest eigenvalues. An explicit first-order expansion and a central limit theorem are est...

Yan-Ling Hu, Xiao Han, Qing Yang · 0 citations
#artificial intelligence Preprint Aug 2026

Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification

Curvature-Aware Radius Shrinkage for Adaptive Nearest Neighbor Classification (CARSANN) is introduced, a geometry-driven framework that adapts the spatial support of each neighborhood according to local geometric complexity and is competitive with adaptive nearest-neighbor methods.

A. L. M. Levada · 0 citations

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