Metric-Aware Principal Component Analysis (MAPCA):A Unified Framework for Scale-Invariant Representation Learning
Michael Leznik

TL;DR
MAPCA is a unified, metric-aware PCA framework that achieves scale-invariant representations and connects various self-supervised learning methods through a geometric lens.
Contribution
Introduces MAPCA, a flexible PCA-based framework with a continuous spectral bias control, unifying several self-supervised learning objectives and clarifying their geometric relationships.
Findings
Beta-family controls spectral bias between PCA and whitening.
Invariant PCA is a special case within the framework.
W-MSE corresponds to an inverse covariance metric, opposite to Barlow Twins.
Abstract
We introduce Metric-Aware Principal Component Analysis (MAPCA), a unified framework for scale-invariant representation learning based on the generalised eigenproblem max Tr(W^T Sigma W) subject to W^T M W = I, where M is a symmetric positive definite metric matrix. The choice of M determines the representation geometry. The canonical beta-family M(beta) = Sigma^beta, beta in [0,1], provides continuous spectral bias control between standard PCA (beta=0) and output whitening (beta=1), with condition number kappa(beta) = (lambda_1/lambda_p)^(1-beta) decreasing monotonically to isotropy. The diagonal metric M = D = diag(Sigma) recovers Invariant PCA (IPCA), a method rooted in Frisch (1928) diagonal regression, as a distinct member of the broader framework. We prove that scale invariance holds if and only if the metric transforms as M_tilde = CMC under rescaling C, a condition satisfied…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
