"Complexity Theoretic Lower Bounds for Sparse Principal Component Detection."

Quentin Berthet, Philippe Rigollet (2013)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2019-05-29

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/colt/BerthetR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colt/BerthetR13
Quentin Berthet, Philippe Rigollet:
Complexity Theoretic Lower Bounds for Sparse Principal Component Detection. COLT 2013: 1046-1066

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.