2000 character limit reached
Nonlinear stochastic multiarmed bandit problems with inexact oracle (1509.01679v9)
Published 5 Sep 2015 in math.OC
Abstract: In the paper we consider one point and two point multiarmed bamdit problems. In other words we consider the online stochastic convex optimization problems with oracle that return the value (realization) of the function at one point or at two points. We allow these values to be inexact, but the level of noise should be small enough. We generalize well known results for inexact oracle case. And we also generalize classical results to prox-structures differ from euclidian.