Experimental Evidence for Asymptotic Non-Optimality of Comb Adversary Strategy

12/03/2019
by   Zachary Chase, et al.
0

For the problem of prediction with expert advice in the adversarial setting with finite stopping time, we give strong computer evidence that the comb strategy for k=5 experts is not asymptotically optimal, thereby giving strong evidence against a conjecture of Gravin, Peres, and Sivan.

READ FULL TEXT

page 1

page 2

page 3

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
11/22/2019

Finite-Time 4-Expert Prediction Problem

We explicitly solve the nonlinear PDE that is the continuous limit of dy...
research
06/20/2022

Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality

We revisit the problem of stochastic online learning with feedback graph...
research
07/27/2011

Asymptotically Optimal Agents

Artificial general intelligence aims to create agents capable of learnin...
research
07/22/2012

Optimal discovery with probabilistic expert advice: finite time analysis and macroscopic optimality

We consider an original problem that arises from the issue of security a...
research
08/31/2020

Asymptotically optimal strategies for online prediction with history-dependent experts

We establish sharp asymptotically optimal strategies for the problem of ...
research
11/30/2021

The Effect of Iterativity on Adversarial Opinion Forming

Consider the following model to study adversarial effects on opinion for...

Please sign up or login with your details

Forgot password? Click here to reset