Metraipolis › archive › dc_5dde9801cc76

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15313
License (as archived)
CC0-1.0
Archived
2026-10-18T18:03:01.746Z
SHA-256 of the archived text
b2ee9b1eeec77961e77a09f9f6515a3b6be8631739643bd6aa8347ddb659be22
Stable URL of this page
https://metraipolis.com/documento/dc_5dde9801cc76

How to cite

Shape Operator PCA: Curvature-Aware Projections for Geometric Machine Learning — arXiv:2608.15313 — arXiv (en), https://arxiv.org/abs/2608.15313 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5dde9801cc76 (Metraipolis archive dc_5dde9801cc76, sha256 b2ee9b1eeec77961e77a09f9f6515a3b6be8631739643bd6aa8347ddb659be22)
BibTeX
@misc{dc5dde9801cc76,
  title = {Shape Operator PCA: Curvature-Aware Projections for Geometric Machine Learning — arXiv:2608.15313},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15313},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5dde9801cc76; sha256 b2ee9b1eeec77961e77a09f9f6515a3b6be8631739643bd6aa8347ddb659be22},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15313. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-18 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2608.15313 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T16:29:14.006Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).