Structured Sparse Principal Component Analysis

We present an extension of sparse PCA, or sparse dictionary learning, where the sparsity patterns of all dictionary elements are structured and constrained to belong to a prespecified set of shapes. This \emph{structured sparse PCA} is based on a structured regularization recently introduced by [1]. While classical sparse priors only deal with \textit{cardinality}, the regularization we use encodes higher-order information about the data. We propose an efficient and simple optimization procedure to solve this problem. Experiments with two practical tasks, face recognition and the study of the dynamics of a protein complex, demonstrate the benefits of the proposed structured approach over unstructured approaches.

💡 Research Summary

The paper introduces a novel extension of Sparse Principal Component Analysis (Sparse PCA) that incorporates structured sparsity constraints, thereby moving beyond the traditional focus on mere cardinality. The authors adopt the structured sparsity‑inducing norm proposed by Jenatton et al., which allows the sparsity pattern of each dictionary atom (or principal component) to be confined to a pre‑specified set of shapes or groups. Formally, given a data matrix (X\in\mathbb{R}^{n\times p}), the objective is

\