A Statistical View of Column Subset Selection
Anav Sood, Trevor Hastie
TL;DR
This work unifies CSS and Principal Variables by showing their exact equivalence under a covariance-based lens and embedding both in a semi-parametric PCSS generative model. It proves a high-dimensional consistency result for the CSS/MLE link, and develops practical, scalable algorithms to perform CSS using only covariance or summary statistics, including when data are missing or censored. The authors introduce a subset-size selection procedure rooted in a likelihood-ratio framework and demonstrate the approach with real data (e.g., BlackRock diversification, ozone detection, Big Five survey) and provide a Python package pycss for practitioners. Overall, the paper delivers a theoretically grounded, computationally efficient framework for interpretable, covariate-based dimensionality reduction with broad applicability in high-dimensional settings.
Abstract
We consider the problem of selecting a small subset of representative variables from a large dataset. In the computer science literature, this dimensionality reduction problem is typically formalized as Column Subset Selection (CSS). Meanwhile, the typical statistical formalization is to find an information-maximizing set of Principal Variables. This paper shows that these two approaches are equivalent, and moreover, both can be viewed as maximum likelihood estimation within a certain semi-parametric model. Within this model, we establish suitable conditions under which the CSS estimate is consistent in high dimensions, specifically in the proportional asymptotic regime where the number of variables over the sample size converges to a constant. Using these connections, we show how to efficiently (1) perform CSS using only summary statistics from the original dataset; (2) perform CSS in the presence of missing and/or censored data; and (3) select the subset size for CSS in a hypothesis testing framework.
