Tighten after Relax: Minimax-Optimal Sparse PCA in Polynomial Time.

Zhaoran Wang Huanran Lu Han Liu

Published in: NIPS (2014)

Keyphrases

worst case
sparse pca
computational complexity
special case
optimal solution
lower bound
dynamic programming
data sets
machine learning
feature selection
training data
least squares
branch and bound