Skip to yearly menu bar Skip to main content


Poster

Random Walk Approach to Regret Minimization

Hariharan Narayanan · Sasha Rakhlin


Abstract:

We propose a computationally efficient random walk on a convex body which rapidly mixes to a time-varying Gibbs distribution. In the setting of online convex optimization and repeated games, the algorithm yields low regret and presents a novel efficient method for implementing mixture forecasting strategies.

Live content is unavailable. Log in and register to view live content