No Internal Regret via Neighborhood Watch

Details No Internal Regret via Neighborhood Watch No Internal Regret via Neighborhood Watch

2011-08-30

arxiv.org/abs/1108.6088v1

Computer Science

Learning

Scientific paper

We present an algorithm which attains O(\sqrt{T}) internal (and thus external) regret for finite games with partial monitoring under the local observability condition. Recently, this condition has been shown by (Bartok, Pal, and Szepesvari, 2011) to imply the O(\sqrt{T}) rate for partial monitoring games against an i.i.d. opponent, and the authors conjectured that the same holds for non-stochastic adversaries. Our result is in the affirmative, and it completes the characterization of possible rates for finite partial-monitoring games, an open question stated by (Cesa-Bianchi, Lugosi, and Stoltz, 2006). Our regret guarantees also hold for the more general model of partial monitoring with random signals.

Affiliated with

Also associated with

No associations

Rating

No Internal Regret via Neighborhood Watch 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 No Internal Regret via Neighborhood Watch, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No Internal Regret via Neighborhood Watch will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-624693