Browsing Department of Pure Mathematics and Mathematical Statistics (DPMMS) by Subject "polynomial time algorithm"
Now showing items 11 of 1

Statistical and computational tradeoffs in estimation of sparse principal components
(Institute of Mathematical StatisticsAnnals of Statistics, 2016)In recent years, Sparse Principal Component Analysis has emerged as an extremely popular dimension reduction technique for highdimensional data. The theoretical challenge, in the simplest case, is to estimate the leading ...