Competing With Strategies

02/12/2013
by   Wei Han, et al.
0

We study the problem of online learning with a notion of regret defined with respect to a set of strategies. We develop tools for analyzing the minimax rates and for deriving regret-minimization algorithms in this scenario. While the standard methods for minimizing the usual notion of regret fail, through our analysis we demonstrate existence of regret-minimization methods that compete with such sets of strategies as: autoregressive algorithms, strategies based on statistical models, regularized least squares, and follow the regularized leader strategies. In several cases we also derive efficient learning algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2012

The Interplay Between Stability and Regret in Online Learning

This paper considers the stability of online learning algorithms and its...
research
09/08/2020

Refined approachability algorithms and application to regret minimization with global costs

Blackwell's approachability is a framework where two players, the Decisi...
research
05/26/2021

An Introduction To Regret Minimization In Algorithmic Trading: A Survey of Universal Portfolio Techniques

In financial investing, universal portfolios are a means of constructing...
research
04/04/2012

Relax and Localize: From Value to Algorithms

We show a principled way of deriving online learning algorithms from a m...
research
01/18/2023

Optimistic Dynamic Regret Bounds

Online Learning (OL) algorithms have originally been developed to guaran...
research
06/08/2021

Decentralized Learning in Online Queuing Systems

Motivated by packet routing in computer networks, online queuing systems...
research
06/16/2015

Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates

In this paper, we provide a novel construction of the linear-sized spect...

Please sign up or login with your details

Forgot password? Click here to reset