Curvature-Aware PCA with Geodesic Tangent Space Aggregation for Semi-Supervised Learning
Not on the map. Why?
Abstract (arXiv)
Principal Component Analysis (PCA) is a fundamental tool for representation learning, but its global linear formulation fails to capture the structure of data supported on curved manifolds. In contrast, manifold learning methods model nonlinearity but often sacrifice the spectral structure and stability of PCA. We propose Geodesic Tangent Space Aggregation PCA (GTSA-PCA), a geometric extension of PCA that integrates curvature awareness and geodesic consistency within a unified spectral framework. Our approach replaces the global covariance operator with curvature-weighted local covariance operators defined over a k-nearest neighbor graph, yielding local tangent subspaces that adapt to the manifold while suppressing high-curvature distortions. We then introduce a geodesic alignment operator that combines intrinsic graph distances with subspace affinities to globally synchronize these local representations. The resulting operator admits a spectral decomposition whose leading components define a geometry-aware embedding. We further incorporate semi-supervised information to guide the alignment, improving discriminative structure with minimal supervision. Experiments on real datasets show consistent improvements over PCA, Kernel PCA, Supervised PCA and strong graph-based baselines such as UMAP, particularly in small sample size and high-curvature regimes. Our results position GTSA-PCA as a principled bridge between statistical and geometric approaches to dimensionality reduction.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 45 references that are in the map. First posted on arXiv 20 Apr 2026.
Builds on
15 of 45 references.
References · 15
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
- 2018Computational Optimal Transportcited by 780
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2019Hyperbolic Graph Convolutional Neural Networkscited by 402
- 2021Graph Learning: A Surveycited by 141
- 2018Learning graphs from data: A signal representation perspectivecited by 119
- 2019Community Detection on Networks with Ricci Flowcited by 62
- 2017Sliced Wasserstein Distance for Learning Gaussian Mixture Modelscited by 59
- 2019Tree-Sliced Variants of Wasserstein Distancescited by 54
3 more
Built on by
Not cited yet.