1 paper across 1 session
We study Bandit Convex Optimization in non-stationary environments by establishing upper and lower regret bounds