arXiv Analytics

Sign in

arXiv:2209.01256 [math.PR]AbstractReferencesReviewsResources

A PDE approach for regret bounds under partial monitoring

Erhan Bayraktar, Ibrahim Ekren, Xin Zhang

Published 2022-09-02Version 1

In this paper, we study a learning problem in which a forecaster only observes partial information. By properly rescaling the problem, we heuristically derive a limiting PDE on Wasserstein space which characterizes the asymptotic behavior of the regret of the forecaster. Using a verification type argument, we show that the problem of obtaining regret bounds and efficient algorithms can be tackled by finding appropriate smooth sub/supersolutions of this parabolic PDE.

Comments: Keywords: machine learning, expert advice framework, bandit problem, asymptotic expansion, Wasserstein derivative
Categories: math.PR, cs.LG, math.OC
Related articles: Most relevant | Search more
arXiv:1611.04960 [math.PR] (Published 2016-11-15)
A PDE approach to a 2-dimensional matching problem
arXiv:2105.13213 [math.PR] (Published 2021-05-27)
Mean Field Games with Mean-Field-Dependent Volatility: A PDE Approach
arXiv:1308.6559 [math.PR] (Published 2013-08-29, updated 2013-11-11)
Partial results on the convexity of the Parisi functional with PDE approach