Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms

Details Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms

2011-02-22

arxiv.org/abs/1102.4442v1

Computer Science

Learning

Scientific paper

We provide consistent random algorithms for sequential decision under partial monitoring, i.e. when the decision maker does not observe the outcomes but receives instead random feedback signals. Those algorithms have no internal regret in the sense that, on the set of stages where the decision maker chose his action according to a given law, the average payoff could not have been improved in average by using any other fixed law. They are based on a generalization of calibration, no longer defined in terms of a Voronoi diagram but instead of a Laguerre diagram (a more general concept). This allows us to bound, for the first time in this general framework, the expected average internal -- as well as the usual external -- regret at stage $n$ by $O(n^{-1/3})$, which is known to be optimal.

Affiliated with

Also associated with

No associations

Rating

Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Internal Regret with Partial Monitoring. Calibration-Based Optimal Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-558550