Hard Uniformity-Constrained Contrastive PCA

• The paper introduces PCA++, a method that extracts shared low-dimensional signal subspaces with a hard uniformity constraint to mitigate background noise.
• It employs a generalized eigenproblem to achieve a closed-form solution, ensuring identity covariance in the projected features for robust performance.
• Empirical evaluations on simulations, corrupted-MNIST, and single-cell RNA-seq data demonstrate PCA++’s superior signal recovery compared to standard PCA and alignment-only methods.

Hard Uniformity-Constrained Contrastive PCA (commonly denoted as PCA++) is a spectral method for extracting low-dimensional shared signal subspaces from paired high-dimensional observations, even under strong structured background noise. The method is rooted in contrastive learning principles and introduces an explicit hard uniformity constraint, ensuring the projected features have identity covariance and thereby regularizing against background interference. PCA++ is characterized by a closed-form solution via a generalized eigenproblem, enjoys provable robustness in high-dimensional regimes, and has demonstrated empirical effectiveness compared to standard PCA and alignment-only contrastive methods (Wu et al., 15 Nov 2025).

1. Problem Formulation and Optimization Objective

Given paired data matrices $X, X^+ \in \mathbb{R}^{n \times d}$, where each pair $(x_i, x_i^+)$ shares an identical low-dimensional signal but different background noise realizations, the objective is to recover the underlying shared subspace. Two covariance structures are central:

• Contrastive (alignment) covariance: $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$, quantifying the statistical alignment of positive pairs.
• Standard sample covariance: $S = \frac{1}{n} X^\top X$, capturing the overall variance structure in the observed data.

PCA++ is defined as the solution to the following constrained optimization problem:

$$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$

The alignment term maximizes the signal correspondence across pairs, while the hard uniformity constraint enforces identity covariance in the projected subspace, preventing the solution from collapsing onto dominant background directions with high variance. For $d \gg n$, an optional truncation is employed whereby $S$ is replaced with a rank-$s$ approximation $S_s$, improving numerical stability by discarding near-zero modes.

2. Closed-Form Solution via Generalized Eigenproblem

The solution employs Lagrangian duality, introducing a symmetric multiplier $M$ for the covariance constraint. The stationarity condition $(x_i, x_i^+)$0 yields the generalized eigenproblem:

$(x_i, x_i^+)$1

The top $(x_i, x_i^+)$2 eigenvectors $(x_i, x_i^+)$3 associated with the largest real generalized eigenvalues $(x_i, x_i^+)$4 constitute the columns of the optimal $(x_i, x_i^+)$5. When using rank-$(x_i, x_i^+)$6 truncation for $(x_i, x_i^+)$7, the procedure involves first projecting into the dominant eigenspace of $(x_i, x_i^+)$8 (with possible ridge regularization), then solving a much smaller eigenproblem in that subspace, and finally mapping back to $(x_i, x_i^+)$9.

3. Algorithmic Workflow

The algorithmic implementation of PCA++ follows these steps:

1. Compute covariance matrices:
   • $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$0
   • $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$1
2. (Optional) Truncation in high dimensions:
   • Eigendecompose $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$2 with top $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$3 eigenpairs
   • Form $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$4
   • Set $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$5
   • Eigendecompose $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$6
   • Obtain generalized eigenvectors $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$7
3. No truncation:
   • Directly solve $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$8 via a standard generalized eigenproblem solver
4. Post-processing:
   • Sort eigenvalues $S_+ = \frac{1}{2n}(X^\top X^+ + {X^+}^\top X)$9 in descending order
   • Return the $S = \frac{1}{n} X^\top X$0 matrix $S = \frac{1}{n} X^\top X$1 whose columns are the top $S = \frac{1}{n} X^\top X$2 eigenvectors

This procedure yields a projection that maximally aligns paired structure while enforcing the dispersion regularization.

4. High-Dimensional Theoretical Properties

The recovery guarantees of PCA++ are analyzed under a linear contrastive factor model:

$S = \frac{1}{n} X^\top X$3

where $S = \frac{1}{n} X^\top X$4 encodes signals, $S = \frac{1}{n} X^\top X$5 encodes backgrounds, $S = \frac{1}{n} X^\top X$6 are low-dimensional latent variables, and $S = \frac{1}{n} X^\top X$7 denote noise.

Theoretical results are provided under two high-dimensional regimes:

A. Fixed-Aspect Ratio ($S = \frac{1}{n} X^\top X$8):

Assume all population "spikes" (signal and background eigenvalues) $S = \frac{1}{n} X^\top X$9 are distinct (BBP detectability). Let $$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$0 denote the recovered PCA++ subspace and $$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$1 the true signal subspace. Then, almost surely,

$$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$2

where $$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$3 is the operator-norm sine of principal angles. When the weakest signal strength $$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$4, the error tends to zero.

B. Growing-Spike Regime ($$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$5):

With $$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$6 and $$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$7, under distinctness,

$$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$8

Uniformity, enforced via the covariance constraint, continues to regularize away background spikes and the limiting recovery performance is controlled by the same mechanism as in the fixed-aspect scenario.

5. Empirical Performance and Comparative Analysis

Experimental evaluations demonstrate the relative strengths and weaknesses of PCA++, standard PCA, and alignment-only PCA+ across various regimes:

• One-signal/one-background simulations: As background strength $$\begin{aligned} & \underset{V \in \mathbb{R}^{d \times k}}{\text{maximize}} && \operatorname{Tr}(V^\top S_+ V) \ & \text{subject to} && V^\top S V = I_k \end{aligned}$$9 or relative dimension $d \gg n$0 increase, both PCA and PCA+ exhibit subspace drift towards background axes, while PCA++ remains stably aligned with the signal.
• High-dimensional simulations: Subspace error for PCA++ matches the asymptotic theoretical predictions.
• Corrupted-MNIST embedding: In two-dimensional embeddings where digits are obscured with added background (“digit+grass”), standard PCA fails to separate classes, PCA+ achieves partial separation, and PCA++ achieves clear separation of classes (specifically, distinguishing '0' from '1' along the principal component).
• Single-cell RNA-seq: For datasets containing invariant and condition-responsive cell types, PCA splits the same cell types by experimental condition, while PCA++ clusters invariant types (e.g., B cells) together and aligns responsive types with true biological variation.

The table below summarizes several empirical comparisons:

Method	Failure Mode	Alignment with Signal (Increasing Background)
Standard PCA	Captures background spikes	Declines
PCA+	Dominated by background if $d \gg n$1 or $d \gg n$2	Declines sharply
PCA++	Suppresses high-variance background directions	Remains stable

6. Practical Considerations and Implementation Guidelines

• Subspace Dimension ($d \gg n$3): When unknown, select $d \gg n$4 by inspecting the spectrum of generalized eigenvalues $d \gg n$5; look for a spectral gap beneath which $d \gg n$6.
• Truncation Rank ($d \gg n$7): Invertibility and stability are maintained by choosing $d \gg n$8 to capture approximately 90% of $d \gg n$9's variance but avoid near-zero eigenvalues. Monitoring the condition number $S$0 is advised.
• Computational Complexity: Covariance computation scales as $S$1 or $S$2. Truncated eigendecomposition costs $S$3 using IRLM or Lanczos when $S$4. The remaining eigenproblem scales as $S$5. Total computational cost: $S$6.
• Numerical Stability: Apply a small ridge $S$7 before inversion and use truncated spectral decompositions along with iterative solvers when appropriate.

In summary, hard uniformity-constrained contrastive PCA (PCA++) provides a principled and scalable approach for signal recovery in paired high-dimensional datasets, with closed-form solutions, robust high-dimensional error guarantees, and empirically verified advantages over both classical and alignment-only contrastive PCA (Wu et al., 15 Nov 2025).