1 citations · 2 across the 18 of their papers we have counts for
1 paper · 2 filters
Chenlu Ye, Yujia Jin, Alekh Agarwal +1
Typical contextual bandit algorithms assume that the rewards at each round lie in some fixed range [0,R], and their regret scales polynomially with this reward range R. Howeve…