"Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the ..."

Manfred K. Warmuth, Dima Kuzmin (2006)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-01-21

- view
  - electronic edition @ neurips.cc (open access)
  - electronic edition @ nips.cc (open access)
- export record
  dblp key:
  - conf/nips/WarmuthK06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/WarmuthK06
Manfred K. Warmuth, Dima Kuzmin:
Randomized PCA Algorithms with Regret Bounds that are Logarithmic in the Dimension. NIPS 2006: 1481-1488

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.