pith. sign in

arxiv: 1705.01091 · v1 · pith:3YVOSMKPnew · submitted 2017-05-02 · 💻 cs.LG

PDE approach to the problem of online prediction with expert advice: a construction of potential-based strategies

classification 💻 cs.LG
keywords predictionboundpotential-basedregretupperadviceapproachargument
0
0 comments X
read the original abstract

We consider a sequence of repeated prediction games and formally pass to the limit. The supersolutions of the resulting non-linear parabolic partial differential equation are closely related to the potential functions in the sense of N.\,Cesa-Bianci, G.\,Lugosi (2003). Any such supersolution gives an upper bound for forecaster's regret and suggests a potential-based prediction strategy, satisfying the Blackwell condition. A conventional upper bound for the worst-case regret is justified by a simple verification argument.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.