A PDE approach for regret bounds under partial monitoring

09/02/2022
by   Erhan Bayraktar, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2020

Error bounds for PDE-regularized learning

In this work we consider the regularization of a supervised learning pro...
research
02/01/2019

An Information-Theoretic Approach to Minimax Regret in Partial Monitoring

We prove a new minimax theorem connecting the worst-case Bayesian regret...
research
02/22/2022

Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini's Regret

We show that a version of the generalised information ratio of Lattimore...
research
04/06/2021

A Latent space solver for PDE generalization

In this work we propose a hybrid solver to solve partial differential eq...
research
02/27/2015

Second-order Quantile Methods for Experts and Combinatorial Games

We aim to design strategies for sequential decision making that adjust t...
research
07/12/2019

Exploration by Optimisation in Partial Monitoring

We provide a simple and efficient algorithm for adversarial k-action d-o...
research
07/12/2023

PDE-Based Parameterisation Techniques for Planar Multipatch Domains

This paper presents a PDE-based parameterisation framework for addressin...

Please sign up or login with your details

Forgot password? Click here to reset