Prediction against limited adversary

10/31/2020
by   Erhan Bayraktar, et al.
0

We study the problem of prediction with expert advice with adversarial corruption where the adversary can at most corrupt one expert. Using tools from viscosity theory, we characterize the long-time behavior of the value function of the game between the forecaster and the adversary. We provide lower and upper bounds for the growth rate of regret without relying on a comparison result. We show that depending on the description of regret, the limiting behavior of the game can significantly differ.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2019

On the asymptotic optimality of the comb strategy for prediction with expert advice

For the problem of prediction with expert advice in the adversarial sett...
research
04/12/2013

Advice-Efficient Prediction with Expert Advice

Advice-efficient prediction with expert advice (in analogy to label-effi...
research
11/05/2019

New Potential-Based Bounds for Prediction with Expert Advice

This work addresses the classic machine learning problem of online predi...
research
08/09/2021

Online Multiobjective Minimax Optimization and Applications

We introduce a simple but general online learning framework, in which at...
research
12/22/2017

Network Utility Maximization in Adversarial Environments

Stochastic models have been dominant in network optimization theory for ...
research
02/18/2013

Online Learning with Switching Costs and Other Adaptive Adversaries

We study the power of different types of adaptive (nonoblivious) adversa...
research
11/22/2019

Finite-Time 4-Expert Prediction Problem

We explicitly solve the nonlinear PDE that is the continuous limit of dy...

Please sign up or login with your details

Forgot password? Click here to reset