Prediction in Online Convex Optimization for Parametrizable Objective Functions

Many techniques for online optimization problems involve making decisions based solely on presently available information: fewer works take advantage of potential predictions. In this paper, we discuss the problem of online convex optimization for parametrizable objectives, i.e. optimization problems that depend solely on the value of a parameter at a given time. We introduce a new regularity for dynamic regret based on the accuracy of predicted values of the parameters and show that, under mild assumptions, accurate prediction can yield tighter bounds on dynamic regret. Inspired by recent advances on learning how to optimize, we also propose a novel algorithm to simultaneously predict and optimize for parametrizable objectives and study its performance using simulated and real data.