"High-Probability Regret Bounds for Bandit Online Linear Optimization."

Peter L. Bartlett et al. (2008)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2020-03-12

- view
  - electronic edition @ helsinki.fi (open access)
- export record
  dblp key:
  - conf/colt/BartlettDHKRT08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colt/BartlettDHKRT08
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, Sham M. Kakade, Alexander Rakhlin, Ambuj Tewari:
High-Probability Regret Bounds for Bandit Online Linear Optimization. COLT 2008: 335-342

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.