06/12/2020

Comparator-Adaptive Convex Bandits

Dirk van der Hoeven, Ashok Cutkosky, Haipeng Luo

Keywords:

Abstract Paper Similar Papers

Abstract: We study bandit convex optimization methods that adapt to the norm of the comparator, a topic that has only been studied before for its full-information counterpart. Specifically, we develop convex bandit algorithms with regret bounds that are small whenever the norm of the comparator is small. We first use techniques from the full-information setting to develop comparator-adaptive algorithms for linear bandits. Then, we extend the ideas to convex bandits with Lipschitz or smooth loss functions, using a new single-point gradient estimator and carefully designed surrogate losses.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at NeurIPS 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 3:01 
 0
 0
 0
 0
 14:50 
 0
 0
 0
 0
 18:43 
 0
 0
 0
 0
 15:18 
 0
 0
 0
 0
 20:29 
 0
 0
 0
 0
 3:21 
 0
 0
 0
 0
 3:24 
 0
 0
 0
 0
 14:41 
 0
 0
 0
 0
 3:00 
 0
 0
 0
 0
 11:21 
 0
 0
 0
 0
 13:54 
 0
 0
 0
 0
 2:57 
 0
 0
 0
 0
 14:10 
 0
 0
 0
 0
 5:02 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 11:11 
 0
 0
 0
 0
 15:02 
 0
 0
 0
 0
 3:12 
 0
 0
 0
 0
 18:01 
 0
 0
 0
 0
 16:53 
 0
 0
 0
 0
 2:58 
 0
 1
 0
 0
 5:10 
 0
 0
 0
 0
 14:05 
 0
 0
 0
 0
 14:39 
 0
 0
 0
 0
 15:10 
 0
 0
 0
 0
 14:43 
 0
 0
 0
 0
 11:30 
 0
 0
 0
 0
 6:23 
 0
 0
 0
 0
 12:19 
 0
 0
 0
 0
 10:21 
 0
 0
 0
 0
 3:24 
 0
 0
 0
 0
 15:05 
 0
 0
 0
 0
 16:52 
 0
 0
 0
 0
 10:02 
 1
 1
 0
 0
 13:17 
 0
 0
 0
 0
 11:59 
 0
 0
 0
 0
 3:25 
 0
 0
 0
 0
 8:12 
 0
 0
 0
 0
 15:41