"Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization."

Aadirupa Saha et al. (2021)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-08-25

- view
  - electronic edition @ mlr.press (open access)
- export record
  dblp key:
  - conf/icml/SahaNNJ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icml/SahaNNJ21
Aadirupa Saha, Nagarajan Natarajan, Praneeth Netrapalli, Prateek Jain:
Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization. ICML 2021: 9255-9264

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.