AIMech AI

Supervised Principal Components

Algorithms AIMech:SupervisedPrincipalComponents DRAFT
Aliases: Supervised Principal Components Regression
A prediction procedure that screens features by their marginal association with an outcome, computes principal components of the retained feature matrix, and uses those components in an outcome regression.
Identity Notes & Concept Scope This record denotes the Bair-Hastie-Paul-Tibshirani screening/PCA/regression procedure. It is distinct from ordinary principal-component regression, sparse PCA, PPCA, partial least squares, supervised gene shaving, and other objectives also called supervised PCA. The ambiguous acronym SPCA is searched but not asserted as an alias. Unlabeled observations are optional in a proposed extension, not required by the base procedure. Three candidate identities were compared against all 442 pinned AIO IDs, labels and scoped synonyms and 460 preceding native IDs, names and aliases, with no normalized collision. Ignored- and hidden-inclusive full-text searches of both checkouts returned the same 144 matching lines across 34 files. Every matched passage was read, comprising 83 unique excerpts; long serialized web captures were inspected around each match with 220-character flanks, not reread in full. Matches are discovery leads, PPCA distinctions, historical reviews and PLSA/count-factorization references, not existing candidate records. All 222 semantic label/synonym rows were read. Twenty-six annotated AIO nodes and outgoing edges comprise 22 byte-verified prior readings and 4 current complete readings. Thirty-six contextual YAMLs comprise 29 unchanged prior readings and 7 current complete readings, including ten native neighbors. This is a bounded snapshot/corpus assessment.

Claims & Grounded Evidence

4 Claims
Mechanism #screen-then-project
For centered training feature columns x_j and response y, the linear-response version scores each nonzero column by s_j=x_j^T y/||x_j|| and retains those with |s_j| greater than a threshold. It computes an SVD of the retained matrix and regresses the outcome on its first or first few left singular vectors. The threshold and component count are tuning choices. Outcome-dependent selection makes the entire fitting procedure nonlinear in the training responses, even though the fitted linear-response predictor is linear in new features.
Mechanism #new-sample-prediction
With retained training SVD X_theta=U D V^T, use weights V D^(-1) for nonzero retained singular values to project new observations centered by the training feature means. For one unit-norm component u, the training linear fit is ybar+(u^T y)u; the same fitted outcome coefficient multiplies the new projected score. The new observation does not need an outcome to obtain its prediction. Generalized-response versions replace the marginal score and outcome regression appropriately, including score-statistic screening and proportional-hazards regression for survival data.
Limitation #screening-and-consistency-limits
The consistency analysis assumes a specified Gaussian latent-factor structure, identifiable separated signal directions, suitable relevant-dimension and signal-to-noise scaling, and adequate recovery of the relevant coordinates. With multiple factors, cancellation can make a relevant feature marginally uncorrelated with the outcome. The paper does not prove that cross-validation selects the correct feature set and notes substantial variability in small samples. Its detailed analysis also distinguishes noise-corrected latent regression coefficients from attenuated uncorrected component coefficients at fixed nonzero noise.
Scope #extensions-and-comparisons
An optional unlabeled-data extension selects features using labeled observations and their outcomes, then estimates components from those selected columns in labeled plus unlabeled observations. This differs from repeatedly selecting all features by correlation with the current component, which loses the original outcome supervision. The procedure does not guarantee better prediction than ridge, partial least squares or other regression methods. The historical microarray examples do not establish clinical validity.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:PrincipalComponentAnalysis
Principal Component Analysis
related_match The procedure computes PCA after outcome-based screening, but adds supervised selection and prediction. The target is task-scoped PCA rather than this complete algorithm.
AIO:RegressionAnalysis
Regression Analysis
related_match The algorithm predicts an outcome through selected component scores. This relates an explicit fitting procedure to the pinned regression task without asserting task/algorithm equivalence.

Evidence Sources & Primary Literature

1 Source
Source ID Publication / Document Type / Access Reference & Checksum
method-source
Eric Bair, Trevor Hastie, Debashis Paul, Robert Tibshirani
primary paper
full_text
ID: doi:10.1198/016214505000000628
sha256:a879f3c53af4…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-12T02:46:01Z
Updated: 2026-10-12T02:47:54Z
Source File: data/curated/SupervisedPrincipalComponents.yaml