arXiv Analytics

Sign in

arXiv:1912.03132 [cs.LG]AbstractReferencesReviewsResources

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

Vladimir A. Kobzar, Robert V. Kohn, Zhilei Wang

Published 2019-12-05Version 1

This work addresses the classic machine learning problem of online prediction with expert advice. A potential-based framework for the fixed horizon version of this problem was previously developed using verification arguments from optimal control theory (Kobzar, Kohn and Wang, New Potential-Based Bounds for Prediction with Expert Advice (2019)). This paper extends this framework to the random (geometric) stopping version. Taking advantage of these ideas, we construct potentials for the geometric version of prediction with expert advice from potentials used for the fixed horizon version. This construction leads to new explicit lower and upper bounds associated with specific adversary and player strategies for the geometric problem. We identify regimes where these bounds are state of the art.

Comments: arXiv admin note: text overlap with arXiv:1911.01641
Categories: cs.LG, cs.GT, math.AP, math.OC, stat.ML
Related articles: Most relevant | Search more
arXiv:1911.01641 [cs.LG] (Published 2019-11-05)
New Potential-Based Bounds for Prediction with Expert Advice
arXiv:1705.01091 [cs.LG] (Published 2017-05-02)
PDE approach to the problem of online prediction with expert advice: a construction of potential-based strategies
arXiv:1906.08031 [cs.LG] (Published 2019-06-19)
XNAS: Neural Architecture Search with Expert Advice