Optimal Stochastic Nonconvex Optimization with Bandit Feedback

Puning Zhao, Lifeng lai

In this paper, we analyze the continuous armed bandit problems for nonconvex cost functions under certain smoothness and sublevel set assumptions. We first derive an upper bound on the expected cumulative regret of a simple bin splitting method. We then propose an adaptive bin splitting method, which can significantly improve the performance. Furthermore, a minimax lower bound is derived, which shows that our new adaptive method achieves locally minimax optimal expected cumulative regret.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment