The following pages link to (Q4998901):
Displaying 4 items.
- Improved regret for zeroth-order adversarial bandit convex optimisation (Q2035748) (← links)
- Interior-Point Methods for Full-Information and Bandit Online Learning (Q5271795) (← links)
- (Q5381137) (← links)
- Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization (Q6183761) (← links)