Dual Adaptivity: A Universal Algorithm for Minimizing the Adaptive Regret of Convex Functions

06/26/2019
by   Moshe Y. Vardi, et al.
2

To deal with changing environments, a new performance measure---adaptive regret, defined as the maximum static regret over any interval, is proposed in online learning. Under the setting of online convex optimization, several algorithms have been successfully developed to minimize the adaptive regret. However, existing algorithms lack universality in the sense that they can only handle one type of convex functions and need apriori knowledge of parameters. By contrast, there exist universal algorithms, such as MetaGrad, that attain optimal static regret for multiple types of convex functions simultaneously. Along this line of research, this paper presents the first universal algorithm for minimizing the adaptive regret of convex functions. Specifically, we borrow the idea of maintaining multiple learning rates in MetaGrad to handle the uncertainty of functions, and utilize the technique of sleeping experts to capture changing environments. In this way, our algorithm automatically adapts to the property of functions (convex, exponentially concave, or strongly convex), as well as the nature of environments (stationary or changing). As a by product, it also allows the type of functions to switch between rounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2023

Universal Online Optimization in Dynamic Environments via Uniclass Prediction

Recently, several universal methods have been proposed for online convex...
research
05/15/2019

Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization

In this paper, we study adaptive online convex optimization, and aim to ...
research
06/11/2023

Parameter-free version of Adaptive Gradient Methods for Strongly-Convex Functions

The optimal learning rate for adaptive gradient methods applied to λ-str...
research
05/08/2021

A Simple yet Universal Strategy for Online Convex Optimization

Recently, several universal methods have been proposed for online convex...
research
07/22/2019

Online optimization of piecewise Lipschitz functions in changing environments

In an online optimization problem we are required to choose a sequence o...
research
04/03/2020

Universal Algorithms: Beyond the Simplex

The bulk of universal algorithms in the online convex optimisation liter...
research
11/06/2017

Online Learning for Changing Environments using Coin Betting

A key challenge in online learning is that classical algorithms can be s...

Please sign up or login with your details

Forgot password? Click here to reset