Complexity Theoretic Lower Bounds for Sparse Principal Component Detection - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Quentin Berthet, Philippe Rigollet. Complexity Theoretic Lower Bounds for Sparse Principal Component Detection. In Shai Shalev-Shwartz, Ingo Steinwart, editors, COLT 2013 - The 26th Annual Conference on Learning Theory, June 12-14, 2013, Princeton University, NJ, USA. Volume 30 of JMLR Proceedings, pages 1046-1066, JMLR.org, 2013. [doi]

This author has not been identified. Look up 'Quentin Berthet' in GoogleThis author has not been identified. Look up 'Philippe Rigollet' in Google

runs on WebDSL