"Information complexity of black-box convex optimization: A new look via ..."

Maxim Raginsky, Alexander Rakhlin (2009)

> Home

Details and statistics

DOI: 10.1109/ALLERTON.2009.5394945

access: closed

type: Conference or Workshop Paper

metadata version: 2023-11-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/allerton/RaginskyR09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/allerton/RaginskyR09
Maxim Raginsky, Alexander Rakhlin:
Information complexity of black-box convex optimization: A new look via feedback information theory. Allerton 2009: 803-510

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.