CORTEXA
← Browse
arxivmath.STcs.LGstat.ME2026-07-18

De-floored Principal Component Regression: When Rank Selection Alone Is Insufficient for Prediction

Peng Zhao

Principal component regression (PCR) regularizes high-dimensional prediction by choosing a spectral cutoff, but rank selection cannot correct systematic inflation of the retained empirical eigenvalues. We study clean Gaussian random designs in which the aggregate covariance tail creates a nearly scalar sample-space floor comparable to the predictive head scale. De-floored principal component regression (dPCR) retains the cutoff and subtracts an estimated floor from the retained denominators. We prove an ordinary-PCR prediction-risk lower bound uniform over all ranks and a high-probability dPCR upper bound. When the floor is sharp and inexpensive to remove in population prediction risk, the conditional risk of dPCR is asymptotically negligible relative to that of the best ordinary PCR rank. An exact risk decomposition explains the separation: denominator inflation is governed by first spectral mass, whereas the clean prediction cost of correction is governed by squared spectral mass. A same-sample trimmed-mean floor estimate attains the oracle dPCR upper-bound rate at a prespecified rank, and the separation persists under approximate predictive alignment when the tail prediction-energy fraction vanishes. Separate pointwise fixed-aspect formulas show that the risk-optimal positive scalar correction improves rank-$1$ PCR, whereas mean-floor subtraction is generally not optimal for a broad Marchenko--Pastur bulk.

View free PDFSource page

Related papers

arxivmath.STcs.LGstat.MEstat.ML2026-07-20

Unveiling Invariant and Transferable Latent Factors Across Heterogeneous Environments via ATLAS

Yihong Gu, Katherine Liao, Tianxi Cai

This paper considers a multi-environment factor model in which high-dimensional covariates are collected from heterogeneous environments, with auxiliary labels available in a subset of these environments. The joint distribution of the covariates may vary across environments, wher…

View free PDFSource page
arxivecon.EMcs.LGmath.STstat.MEstat.ML2026-07-20

Vector Search As Nearest Neighbor Matching: RAG-based Policy Learning in Causal Inference

Masahiro Kato, Taka Kato

We propose one-step and two-step methods for policy learning with retrieval-augmented generation (RAG). We formulate RAG-based action selection under the potential outcome framework. In the two-step method, vector search retrieves action-specific neighboring evidence in an embedd…

View free PDFSource page
arxivmath.STcs.LGstat.MEstat.ML2026-07-31

Differentially Private Nonparametric Modal Learning with Applications to Regression and Clustering

Arkajyoti Bhattacharjee, Arnab Auddy

Density modes provide a localized and interpretable summary of multimodal distributions, but their estimation under rigorous differential privacy constraints remains largely unexplored. We study differentially private recovery of density modes for multivariate distributions under…

View free PDFSource page
arxivstat.MEcs.LGmath.STstat.ML2026-07-17

Aggregation of Statistical Evidence under Exchangeability

Antonin Schrab, Rajen Shah, Arthur Gretton, Ilmun Kim

We study aggregation of statistical evidence under unknown and potentially complex dependence using group-invariance. Building on permutation-based constructions that treat transformed datasets as exchangeable units, we aggregate evidence across statistics for each transformed da…

View free PDFSource page
arxivstat.MLcs.LGmath.STstat.COstat.ME2026-07-10

Deep Gaussian Processes on Directed Acyclic Graphs

Federico L. Perlino, Oliver Hamelijnck, Adam M. Johansen, Theodoros Damoulas

Many real-world processes can be represented as compositions of functions along a directed acyclic graph (DAG). In causal modelling, these correspond to the underlying mechanisms; in engineering, to multiple fidelity levels; and in gene-regulatory networks, to transcription facto…

View free PDFSource page
arxivstat.MLcs.LGmath.STstat.ME2026-07-02

Contaminated Multi-task Learning with Heterogeneity: Fundamental Limits and Optimal Algorithms

Ye Tian, Mengchu Li, Marco Avella Medina

Integrating information across related tasks can improve estimation and prediction in transfer, multi-task, and federated learning, but contamination and heterogeneity make robust borrowing challenging. We study a contaminated multi-task empirical risk minimization (ERM) framewor…

View free PDFSource page