Finite-Time 4-Expert Prediction Problem

11/22/2019
by   Erhan Bayraktar, et al.
0

We explicitly solve the nonlinear PDE that is the continuous limit of dynamic programming of expert prediction problem in finite horizon setting with N=4 experts. The expert prediction problem is formulated as a zero sum game between a player and an adversary. By showing that the solution is C^2, we are able to show that the strategies conjectured in arXiv:1409.3040G form an asymptotic Nash equilibrium. We also prove the "Finite vs Geometric regret" conjecture proposed in arXiv:1409.3040G for N=4, and we give a stronger conjecture which characterizes the relation between the finite and geometric stopping.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/03/2019

Experimental Evidence for Asymptotic Non-Optimality of Comb Adversary Strategy

For the problem of prediction with expert advice in the adversarial sett...
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...
12/05/2019

New Potential-Based Bounds for the Geometric-Stopping Version of Prediction with Expert Advice

This work addresses the classic machine learning problem of online predi...
04/25/2019

Prediction with Expert Advice: a PDE Perspective

This work addresses a classic problem of online prediction with expert a...
11/05/2019

New Potential-Based Bounds for Prediction with Expert Advice

This work addresses the classic machine learning problem of online predi...
10/31/2020

Prediction against limited adversary

We study the problem of prediction with expert advice with adversarial c...
07/31/2020

Online Prediction With History-Dependent Experts: The General Case

We study the problem of prediction of binary sequences with expert advic...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.