Complexity Theoretic Lower Bounds for Sparse Principal Component Detection

Quentin Berthet, Philippe Rigollet

Abstract: In the context of sparse principal component detection, we bring evidence towards the existence of a statistical price to pay for computational efficiency. We measure the performance of a test by t...