$O(k)$-Equivariant Dimensionality Reduction on Stiefel Manifolds
Andrew Lee, Harlin Lee, Jose A. Perea, Nikolas Schonsheck, Madeleine, Weinstein

TL;DR
This paper introduces an $O(k)$-equivariant dimensionality reduction algorithm for high-dimensional Stiefel and Grassmannian manifolds, enabling efficient lower-dimensional embeddings while preserving geometric structure.
Contribution
The paper proposes the Principal Stiefel Coordinates (PSC) algorithm for $O(k)$-equivariant reduction from $V_k( eal^N)$ to $V_k( eal^n)$, extending to Grassmannians, with PCA and gradient descent methods for embedding.
Findings
PSC achieves low distortion in noiseless data
Gradient descent embedding improves fit for noisy data
Method validated on synthetic and real-world datasets
Abstract
Many real-world datasets live on high-dimensional Stiefel and Grassmannian manifolds, and respectively, and benefit from projection onto lower-dimensional Stiefel and Grassmannian manifolds. In this work, we propose an algorithm called \textit{Principal Stiefel Coordinates (PSC)} to reduce data dimensionality from to in an \textit{-equivariant} manner (). We begin by observing that each element defines an isometric embedding of into . Next, we describe two ways of finding a suitable embedding map : one via an extension of principal component analysis (), and one that further minimizes data fit error using gradient descent (). Then, we define a continuous and -equivariant map…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFace and Expression Recognition · AI in cancer detection · Statistical Methods and Inference
MethodsPrincipal Components Analysis
