"Improved Regret Bounds for Projection-free Bandit Convex Optimization."

Dan Garber, Ben Kretzu (2020)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-06-29

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/aistats/GarberK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aistats/GarberK20
Dan Garber, Ben Kretzu:
Improved Regret Bounds for Projection-free Bandit Convex Optimization. AISTATS 2020: 2196-2206

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.